#include<iostream>
#include<algorithm>
using namespace std;
int a[1000005];
int main()
{
    ios::sync_with_stdio(false);
    int n,m,l,r,mid,ans = -1,find;
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }
    cin >> m;
    for(int i = 0;i < m;i++)
    {
        cin >> find;
        l = 1,r = n,ans = -1;
        while(l <= r)
        {
            mid = (l+r) / 2;
            if(find > a[mid])
            {
                l = mid + 1;
            }
            else
            {
                r = mid - 1;
                ans = mid;
            }
            
        }
        if(a[ans] == find)
        {
            cout << ans << " ";
        }
        else
        {
            cout << "-1 ";
        }
    }
    cout << endl;
    return 0;
}