# include<iostream>
# include<algorithm>
using namespace std;
int jishu(int a[],int N,int key)
{
    int left = 0, right = N-1 , mid,flag=0;
    while(left<=right)
    {
        mid = left + (left + right)/2 ;
        if(key == a[mid])
        {
            flag=1 ; break;
        }
        else if(key < a[mid])
        {
            right = mid - 1;
        }
        else
        {
            left = mid + 1;
        }
    }
    int count = 0;
    if(flag==0)
    {
        return count;
    }
    else
    {
        for(int i=mid;i<N;i++)
        {
            if(a[i]==key)
            {
                count++;
            }
            else
            {
                break;
            }
        }
        for(int i=mid-1;i>=0;i--)
        {
            if(a[i]==key)
            {
                count++;
            }
            else
            {
                break;
            }
        }
        return count;
    }
}
int main()
{
    int N,K,i,j;
    cin>>N;
    int a[N];
    for(i=0;i<N;i++)
    {
        cin>>a[i];
    }
    sort(a,a+N);
    cin>>K;
    int b[K];
    for(i=0;i<K;i++)
    {
        cin>>b[i];
        if(i != K-1)
        {
            cout<<jishu(a,N,b[i])<<" ";
        }
        else
        {
            cout<<jishu(a,N,b[i]);
        }
    }
    return 0;
}