#include<stdio.h>
#include<stdlib.h>
const int N=100001;
int n,m,v[N],intr,x;
void citire()
{
	for(int i=1;i<=n;++i)
		scanf("%d",&v[i]);
	scanf("%d",&m);
}
int compar(const void *q,const void *p)
{
	int x=*(int*)q,y=*(int*)p;
	if(x>y)
		return 1;
	else return -1;
	return 0;
}
int op0()
{
	int step,i;
	for(step = 1;step<n;step<<=1);
	for(i = 0;step;step>>=1)
		if(i+step<n && v[i+step]<=x)
			i+=step;
	return i;
}
int op1()
{
	int i,step;
	for(step = 1;step<n;step<<=1);
	for(i=0;step;step>>=1)
		if(i+step<n && v[i+step]<=x)
			i+=step;
	return i;
}
int op2()
{
	int i,step=1;
	for(i=0;step<=n;step<<=1)
		if(i+step<n && v[i+step]>=x)
			i+=step;
	return i;
}
int main()
{
	freopen("cautbin.in","r",stdin);
	freopen("cautbin.out","w",stdout);
	scanf("%d",&n);
	citire();
	qsort(v+1,n,sizeof(v[0]),compar);
	for(int i=1;i<=m;++i)
	{
		scanf("%d%d",&intr,&x);
		if(intr==0)
			printf("%d\n",op0());
		if(intr==1)
			printf("%d\n",op1());
		if(intr==2)
			printf("%d\n",op2());
	}
	return 0;
}