#include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
vector<int>v(n);
for(int &i:v)cin>>i;
int k;
cin>>k;
unordered_map<int,int>mp;
int mn=INT_MAX;
for(int i=0;i<n;i++){
int start= abs(v[i]-k);
if(mp.count(start)){
mn=min(mn,i-mp[start]+1);
}
mp[v[i]]=i;
}
if(mn==INT_MAX)cout<<-1<<"\n";
else cout<<mn<<"\n";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgc29sdmUoKXsKICAgIGludCBuOwogICAgY2luPj5uOwogICAgdmVjdG9yPGludD52KG4pOwogICAgZm9yKGludCAmaTp2KWNpbj4+aTsKICAgIGludCBrOwogICAgY2luPj5rOwogICAgdW5vcmRlcmVkX21hcDxpbnQsaW50Pm1wOwogICAgaW50IG1uPUlOVF9NQVg7CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKXsKICAgICAgICBpbnQgc3RhcnQ9IGFicyh2W2ldLWspOwogICAgICAgIGlmKG1wLmNvdW50KHN0YXJ0KSl7CiAgICAgICAgICAgIG1uPW1pbihtbixpLW1wW3N0YXJ0XSsxKTsKICAgICAgICB9CiAgICAgICAgbXBbdltpXV09aTsKICAgIH0KICAgIGlmKG1uPT1JTlRfTUFYKWNvdXQ8PC0xPDwiXG4iOwogICAgZWxzZSBjb3V0PDxtbjw8IlxuIjsKfQoKaW50IG1haW4oKXsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShOVUxMKTsKICAgIHNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQ==