一本通1102

//qf
#include<bits/stdc++.h>
#define f(i,j,n) for(register int i=j;i<=n;i++)
using namespace std;
typedef long long ll;
inline ll read(){
	ll x=0;
	int f=1;
	char ch=getchar();
	while(!isdigit(ch)) {
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)) x=(x<<1)+(x<<3)+ch-48,ch=getchar();
	return x*f;
}
int n=read();
int a[1<<7];
signed main(){
	f(i,1,n) a[i]=read();
	int s=read();
	int cnt=0;
	f(i,1,n) if(a[i]==s) cnt++;
	cout<<cnt<<endl;
	return 0;
}