#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit 20
#define inf 500000000
#define N 100
#define mod  1999999973
#define inu "cautbin.in"
#define outu "cautbin.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int v[N],n,m,x,t;
int cb(int x)
{
	int st=1,dr=n,mij,sol=-1;
	while(st<=dr)
	{
		int mij=(st+dr)>>1;
		if(v[mij]<=x)
			st=mij+1;
		else
			dr=mij-1;
		if(v[mij]==x)
			sol=mij;
	}
	return sol;
}
int cbd(int x)
{
	int st=1,dr=n,mij,sol;
	while(st<=dr)
	{
		int mij=(st+dr)>>1;
		if(v[mij]<=x)
		{
			sol=mij;
			st=mij+1;
		}
		else
			dr=mij-1;
	}
	return sol;
}
int cbs(int x)
{
	int st=1,dr=n,mij,sol;
	while(st<=dr)
	{
		int mij=(st+dr)>>1;
		if(v[mij]>=x)
		{
			sol=mij;
			dr=mij-1;
		}
		else
			st=mij+1;
	}
	return sol;
}
int main ()
{
	f>>n;
	FOR(i,1,n)
	f>>v[i];
	sort(v+1,v+n+1);
	f>>m;
	FOR(i,1,m)
	{
		f>>t>>x;
		if(!t)
			g<<cb(x)<<"\n";
		if(t==1)
			g<<cbd(x)<<"\n";
		if(t==2)
			g<<cbs(x)<<"\n";
	}
	return 0;
}