#include<bits/stdc++.h> using namespace std; int a[100],b[100]; int binary_search(int left,int right,int key){ while(left<=right){ int mid=(left+right)/2; if(a[mid]<key){ left=mid+1; } if(a[mid]>key){ right=mid-1; } if(a[mid]==key){ return mid; } } return -1; } int main() { int n,m; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } cin>>m; for(int i=0;i<m;i++){ cin>>b[i]; } for(int i=0;i<m;i++){ cout<<binary_search(0,n-1,b[i])<<" "; } }