//cautbin de pe infoarena, folosind STL(upper si lower bound)
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int i,n,m,x,op,a;
vector<int> V;
vector<int>::iterator p;
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("cautbin.in","r",stdin);
	freopen("cautbin.out","w",stdout);
	scanf("%d",&n);
	V.push_back(0);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x);
		V.push_back(x);
	}
	sort(V.begin(),V.end());
}
void solve()
{
	scanf("%d",&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&op,&a);
		switch(op)
		{
			case 0:			
				printf("%d\n",(p = upper_bound(V.begin(),V.end(),a))!= V.end()&&p!=V.begin()&&V[p-V.begin()-1]==a ? p-V.begin()-1 : -1);
				break;
			case 1:
				printf("%d\n",lower_bound(V.begin(),V.end(),a+1)-V.begin()-1); 
				break;
			case 2:
				printf("%d\n",upper_bound(V.begin(),V.end(),a-1)-V.begin());
				break;
		}
	}
}