#include<bits/stdc++.h>
#define int long long
using namespace std; 
int n, m, k;
struct Node{
	int val, id;
}a[100005];
int cmp(Node x, Node y){
	return x.val < y.val;
}
bool check(int lpos, int rpos, int x){
	int lt=lpos-1,rt=rpos+1;
	while(lt+1 < rt){
		int mid=(lt+rt)/2;
		if(a[mid].val < x)
			lt=mid;
		else if(a[mid].val==x)
			return a[mid].id;
		else
			rt=mid;
	}
	return 0;
}
signed main()
{
	cin>>n;
	for(int i=1; i<=n; i++){
		cin>>a[i].val;
		a[i].id=i;
	}
	sort(a+1, a+n+1, cmp);
	cin>>m;
	while(m--){
		cin>>k;
		cout<<check(1, n, k)<<endl;
	}
	return 0;
}

求大佬查个错，感谢！！！！！