#include<iostream>

using namespace std;
long n,x,s=0;
int main(){
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++) cin>>a[i];
	cin>>x;
	for(int i=0;i<n;i++){
		if(a[i]==x) s++;
	}
	cout<<s;
	return 0;
}

//桶排
#include<bits/stdc++.h>
using namespace std;
int l[255555],a;
short n;
int main(){
   cin>>n;
   for(int i=1;i<=n;i++){
      cin>>a;
      l[a]++;}
   cin>>n;
   cout<<l[n];
   return 0;
}

#include<iostream>
using namespace std;
int main (){
    int a[99],b,sum=0,c;
    cin>>b;
    int d=b;
    while(d--)cin>>a[d];
	cin>>c; 
    while(b--)if(a[b]==c)sum++;
    cout<<sum;
    return 0;
}

短小精悍1.0 不要抄哦！还是有坑

#include<queue>
#include<stack>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;   
int main ()
{
    int a[99];
    int b,sum=0,c;
    cin>>b;
    int d=b;
    while(d--)
    {
    	cin>>a[d];//输出
	}
	cin>>c; 
    while(b--)//遍历数组
    {
        if(a[b]==c)
        {
            sum++;
        }
    }
    cout<<sum;//输出
    return 0;
}

不要抄哦！有坑

#include<iostream>
#include<cmath>
using namespace std;
int a[101],n,m,sum=0;
int main() {
	cin>>n;
	for(int i=0;i<n;++i)
	{
	cin>>a[i];
	}
	cin>>m;
	for(int j=0;j<n;++j)
	{
	if(a[j]==m)
		sum++;
	}
	cout<<sum;
	return 0;
}

#include<bits/stdc++.h> using namespace std;

int main(){ int N,m,sum=0; cin>>N; const int n=N; int a[n]; for (int i=0;i<=n-1;i++){ cin>>a[i]; } cin>>m; for(int j=0;j<=n-1;j++){ if(a[j]==m){ sum+=1; } } cout<<sum; return 0; }

#include <iostream>
using namespace std;
int n,m,ans=0;
int main(){
	cin>>n;
	int a[n]={0};
	for(int i=1;i<=n;i++) cin>>a[i];
	cin>>m;
	for(int i=1;i<=n;i++){
		if(a[i]==m) ans++;
	}
	cout<<ans<<endl;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv){
	int n,a[105],m,cnt = 0;
	cin >> n;
	for (int i = 0;i < n;i++){
		cin >> a[i];
	}
	cin >> m;
	for (int i = 0;i < n;i++){
		if (a[i] == m){
			cnt++;
		}
	}
	cout << cnt;
	return 0;
}