#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;
}