#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n,q;
ll ans[1000010],ans1;
struct st {
	int wz;
	int mb;
	int xh;
} a[1000010];
bool cmp(st x,st y) {
	return x.wz < y.wz;
}
int main() {
	cin >> n;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i].wz;
		a[i].xh = i;
	}
	sort(a + 1,a + n + 1,cmp);
	cin >> q;
	for(int i = 1; i <= q; i ++) {
		cin >> a[i].mb;
	}
	for(int i = 1; i <= q; i ++) {
		ll l = 1,r = n;
		while(l < r) {
			ll mid = (l + r) >> 1;
			if(mid >= a[i].mb) r = mid;
			else l = mid + 1;
		}
		if(a[l].wz == a[i].mb)
			ans[i] = a[l].xh;
		else ans[i] = 0;
	}
	for(int i = 1; i <= q; i ++) {
		if(ans1 + 1 == q) {
			cout << ans[i];
		} else {
			cout << ans[i];
			cout << endl;
			ans1 ++;
		}
	}
}