#include<bits/stdc++.h> #include<algorithm> #include<functional> using namespace std; int main(){ int n,m; cin>>n; int s[n]; for(int i=0;i<n;++i){ cin>>s[i]; } cin>>m; sort(s,s+n,greater<int>()); for(int f=0;f<n;++f){ if(s[f]==m){ cout<<f+1; break; } } return 0;}