#include<bits/stdc++.h> using namespace std; long long n,a[100000],b[100000],q; int zhao(int x){ long long r=n,l=1,mid; while(l<=r){ mid=l+r>>1; if(x<=a[mid]) r=mid-1; else l=mid+1; } if(a[l]==x) return l; else return -1; } int main(){ scanf("%lld",&n); for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); } scanf("%lld",&q); for(int i=1;i<=q;i++){ scanf("%lld",&b[i]); cout<<zhao(b[i])<<" "; } return 0; }/*6 1 2 2 2 3 3 3 3 2 5*/