#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <map>
#include <cstring>
#include <algorithm>
#define range(i,a,b) for(int i=a;i<=b;++i)
#define rerange(i,a,b) for(int i=a;i>=b;--i)
#define LL long long
#define fill(arr,tmp) memset(arr,tmp,sizeof(arr))
using namespace std;
map<int,int>data;
int n,aim;
void init(){
cin>>n;
range(i,1,n){
int tmp;
cin>>tmp;
data[tmp]++;
}
cin>>aim;
}
void solve(){
map<int,int>::iterator iter;
for(iter=data.begin();iter!=data.end();++iter)
if(iter->first==aim){
n-=iter->second;
break;
}
cout<<n<<endl;
}
int main(){
init();
solve();
return 0;
}