C++ :

#include<bits/stdc++.h>
using namespace std;

struct node{
    int num,pos;
}a[100010];
int n,m;

bool cmp(node n1,node n2){
    return n1.num < n2.num;
}

int fun(int x){
    int l = 1,r = n,mid;
    while(l <= r){
        mid = l + r >> 1;
        if(a[mid].num == x) return a[mid].pos;
        else if(x < a[mid].num) r = mid - 1;
        else l = mid + 1;
    }

    return 0;
}

int main()
{
    scanf("%d",&n);
    for(int i = 1;i <= n;i++){
        scanf("%d",&a[i].num);
        a[i].pos = i;
    }

    sort(a+1,a+n+1,cmp);
    scanf("%d",&m);
    int x;
    for(int i = 1;i <= m;i++){
        scanf("%d",&x);
        printf("%d\n",fun(x));
    }
    return 0;
}