#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int f[N],n,l,r,m,k;
int find(int g){
	l=1,r=n;
	while(l<=r){
		int mid=(l+r)/2;
		if(f[mid]>=g){
			r=mid-1;
		}
		else{
			l=mid+1;
		}
	}
	if(f[l]==g){
		return l;
	}
	else{
		return -1;
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>f[i];
	}
	cin>>m;
	while(m--){
		cin>>k;
		cout<<find(k)<<" ";
	}
	return 0;
}