#include <iostream>
#include <cstring>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll int binary_search(ll int a[],ll int n,ll int key){
ll int sta = 0,end = n-1;
ll int ans = -1;
while(sta<=end){
ll int mid = (sta+end)/2;
if(a[mid]==key){
return mid;
}
else if(a[mid]<key){
sta = mid+1;
}
else{
end = mid-1;
}
}
return ans;
}
int main(){
ll int n,m;
cin >> n;
ll int a[n];
for(ll int i=0;i<n;i++){
cin >> a[i];
}
cin >> m;
cout<<(a,n,m);
}