#include <iostream>
#include <cstdio>
#include <vector>
#define nmax 100005
using namespace std;

int m,n,poz,tip;
int x[nmax];

int tipu1(int nr)
{
    int i=0,k=poz;
    for(;k>0 && i<=n;k>>=1)
        if(i+k<=n)
            if(x[i+k]<=nr) i+=k;
    return i;
}

int tipu2(int nr)
{
    int i=n,k=poz;
    for(;i>0 && k>0;k>>=1)
        if(i-k>0)
            if(x[i-k]>=nr) i-=k;
    return i;
}

int main()
{
    int i;
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&x[i]);
    scanf("%d",&m);
    int nr;
    for(poz=1;poz<=n;poz<<=1);
    for(;m;m--)
    {
        scanf("%d%d",&tip,&nr);
        if(tip==0 || tip==1) printf("%d\n",tipu1(nr));
        if(tip==2) printf("%d\n",tipu2(nr));
    }
    fclose(stdout);
    fclose(stdout);
    return 0;
}