#include<bits/stdc++.h> using namespace std; long long n,a[1000001],x,middle,low,high; int bin(long long low,long long high) { if(low>high) return -1; else { middle=(low+high)/2; if(x==a[middle]) return middle+1; else if(x<a[middle]) { high=middle-1; bin(low,high); } else if(x>a[middle]) { low=middle+1; bin(low,high); } } } int main() { cin>>n; for(int i=0;i<n;i++) cin>>a[i]; cin>>x; low=0,high=n-1; cout<<bin(low,high); return 0; }