#include<bits/stdc++.h>
using namespace std;
#define ll long long
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);
}
if(!mp.count(v[i]))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;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCiNkZWZpbmUgbGwgbG9uZyBsb25nCgp2b2lkIHNvbHZlKCl7CiAgICBpbnQgbjsKICAgIGNpbj4+bjsKICAgIHZlY3RvcjxpbnQ+dihuKTsKICAgIGZvcihpbnQgJmk6diljaW4+Pmk7CiAgICBpbnQgazsKICAgIGNpbj4+azsKICAgIHVub3JkZXJlZF9tYXA8aW50LGludD5tcDsKICAgIGludCBtbj1JTlRfTUFYOwogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAgICAgaW50IHN0YXJ0PSBhYnModltpXS1rKTsKICAgICAgICBpZihtcC5jb3VudChzdGFydCkpewogICAgICAgICAgICBtbj1taW4obW4saS1tcFtzdGFydF0rMSk7CiAgICAgICAgfQogICAgICAgIGlmKCFtcC5jb3VudCh2W2ldKSltcFt2W2ldXT1pOwogICAgfQogICAgaWYobW49PUlOVF9NQVgpY291dDw8LTE8PCJcbiI7CiAgICBlbHNlIGNvdXQ8PG1uPDwiXG4iOwp9CgppbnQgbWFpbigpewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKE5VTEwpOwogICAgc29sdmUoKTsKICAgIHJldHVybiAwOwp9