countofnousinghashing.cpp

//given array a of N integers . Given Q queries and in each query a given number X , print count of thta number in array.
/*#include<bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
     cin>>a[i];
    int q;
    cin>>q;
    while(q--){
        int x;
        cin>>x;
        int ct=0;
        for(int i=0;i<n;i++){
            if(a[i]==x)
            ct++;
        }
        cout<<ct<<endl;
    }
    return 0; // O(n^2)
}*/

#include<bits/stdc++.h>
using namespace std;
const int N=1e7+10;
int hsh[N];
int main(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++){
     cin>>a[i];
     hsh[a[i]]++;
     }
      int q;
    cin>>q;
    while(q--){
        int x;
        cin>>x;
    
        cout<<hsh[x]<<endl;
    }
    return 0;
    //O(N)