#include<bits/stdc++.h> using namespace std; const int N=100010; int a[N]; int n,q; int fun(int x){ int l=1, r=n, 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("%d",&n); for(int i=1; i<=n; i++) scanf("%d",&a[i]); scanf("%d",&q); int x; for(int i=1; i<=q; i++){ scanf("%d",&x); printf("%d ",fun(x)); } return 0; }