#include<bits/stdc++.h>
using namespace std;
struct f{
    int j,b;
}a[1000000];
int n,q;
bool cmp(f x,f y){
    return x.j<y.j;
}
bool f(int x){
    int l=0,r=n+1;
    while(l<r){
        int mid=l+(r-l)/2;
        if(a[mid].j==x)return mid;
        else if(a[mid].j<x)l=mid;
        else r=mid;
    }
    return 0;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].j;
        a[i].b=i;
    }
    cin>>q;
    sort(a,a+1+n,cmp);
    while(q--){
    	int c;
    	cin>>c;
    	if(f(c))cout<<a[c].b;
    	else cout<<"0";
	}
}