#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
int v[100001],n,m,q,x,nr,ok,i,j,k,poz,maxim,dr,st;
int main()
{
    f>>n;
    maxim=0;
    for(i=1; i<=n; i++)
    {
        f>>v[i];
        if(v[i]>maxim)
        {
            maxim=v[i];
        }
        v[i]=maxim;
    }
    f>>k;
    for(x=1; x<=k; x++)
    {f>>q;
dr=upper_bound(v+1,v+n+1,q)-v;
st=lower_bound(v+1,v+n+1,q)-v;
g<<dr-st<<" ";
    }
    return 0;
}