#include<iostream>
#include<algorithm>
using namespace std;
const int N=100005;
struct position
{
	double rank;
	double num;
}a[N];
bool cmp(position x,position y)
{
	return x.num<=y.num;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].num;
		a[i].rank=i;
	}
	sort(a+1,a+1+n,cmp);
	int k=0;
	cin>>k;
	while(k--)
{
	int c,count=0;
	cin>>c;
	int l=1,r=n;
	while(l<=r)
	{
		int mid=(l+r)/2;
		if(a[mid].num==c)
		{
			count=1;
			printf("%.0f\n",a[mid].rank);
			break;
		}
		else{
			if(a[mid].num>c)
			{
				r=mid-1;
			}
			else{
				l=mid+1;
			}
		}
	}
	if(count==0)
	{
		printf("0\n");
	}
}
	
	return 0;
}

全WA了 ┭┮﹏┭┮wa的一声就哭了出来 咋错了