#include<bits/stdc++.h>
using namespace std;
inline int rea() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
struct Node {int id, num;};
bool cmp(Node x, Node y) {
return x.num < y.num;
}
int main() {
int n = rea(), m;
Node a[n + 1];
for (int i = 1; i <= n; ++i)a[i].num = rea(), a[i].id = i;
sort(a + 1, a + n + 1, cmp);
m = rea();
while (m--) {
int tmp = rea();
int l = 1, r = n;
while (l < r) {
int mid = l + r >> 1;
if (a[mid].num >= tmp)r = mid;
else l = mid + 1;
}
if (a[l].num == tmp)cout << a[l].id << endl;
else cout << 0 << endl;
}
return 0;
}