#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> arr(n);
for(int i =0; i < n; i++)
cin >> arr[i];
int k; cin >> k;
unordered_map<int,int> mp;
int ans = INT_MAX;
for(int i = 0; i < n; i++){
int req = k-arr[i];
if(mp.find(req) != mp.end()){
int dist = i-mp[req];
ans = min(ans, dist);
}
mp[arr[i]] = i;
}
cout << ans+1;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOyBjaW4gPj4gbjsKCXZlY3RvcjxpbnQ+IGFycihuKTsKCWZvcihpbnQgaSAgPTA7IGkgPCBuOyBpKyspCgljaW4gPj4gYXJyW2ldOwoJaW50IGs7IGNpbiA+PiBrOwoJCgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+IG1wOwoJaW50IGFucyA9IElOVF9NQVg7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKCQlpbnQgcmVxID0gay1hcnJbaV07CgkJaWYobXAuZmluZChyZXEpICE9IG1wLmVuZCgpKXsKCQkJaW50IGRpc3QgPSBpLW1wW3JlcV07CgkJCWFucyA9IG1pbihhbnMsIGRpc3QpOwoJCX0KCQltcFthcnJbaV1dID0gaTsKCX0KCWNvdXQgPDwgYW5zKzE7CglyZXR1cm4gMDsKfQ==