#include <bits/stdc++.h>
using namespace std;
int n,a[30005],t,x,lft,rht,mid;
int main( )
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {
        scanf("%d",&x);
        lft = 0;
        rht = n;
        while( rht - lft > 1){
            mid=( lft + rht )/2;
            if( a[mid] >= x)
            {
                rht = mid;
            }
            else
            {
                lft = mid;
            }
        }
        if( a[rht]==x)
        {
            cout << rht << ' ';
        }
        else
        {
            cout << -1 << ' ';
        }
    }

    return 0;
}