#include<bits/stdc++.h>
using namespace std;
int n,m;
struct s
{
    int num;
    int id;
}arr[1000001];
bool cmp(s o,s p)
{
    return o.num>p.num;
}
int binary(int num)
{
    int l=1,r=n;
    while (l<=r)
    {
        int mid=(l+r)/2;
        if (arr[mid].num<=num)
            l=mid+1;
        else
            r=mid-1;
    }
    if (arr[l].num==num)
        return arr[l].id;
    else
        return 0;
}

int main()
{
    cin>>n;
    for (int i=1;i<=n;i++)
        cin>>arr[i].num;
    cin>>m;
    sort(arr+1,arr+1+n,cmp);
    for (int i=1;i<=m;i++)
    {
        int x;
        cin>>x;
        cout<<binary(x)<<endl;
    }
}