#include<bits/stdc++.h> using namespace std; long long n,a[1000050],q,x,mid; int f(int z){ int l=1; int r=n,mid; while(l<=r){ mid=l+r>>1; if(z>=a[mid]) l=mid+1; else r=mid-1; } if(a[r]==z) return r; else return -1; } int main(){ cin>>n; for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } cin>>q; while(q--){ scanf("%d",&x); f(x); cout<<f(x)<<" "; } return 0;