#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int i,j,n,v[1000],a,b,m;
int zero(int v[],int n,int k)
{
    int mijl;
    int st=1, dr=n;
    while(st<=dr)
    {
        mijl=(st+dr)/2;
        if(v[mijl]<=k)
            st=mijl+1;
            else
            dr=mijl-1;
    }
    mijl=(dr+st)/2;
    return mijl;
}

int bsearch1 (int p, int u, int key) {
    int m, n = u;

    while (p < u){
        m = (p + u) / 2;
        if (v[m] <= key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] > key)
       -- m;
    return m;
}

int doi(int v[],int n,int k)
{
    int mijl;
    int st=1, dr=n;
    while(st<=dr)
    {
        mijl=(st+dr)/2;

        if(v[mijl]>=k)
            dr=mijl-1;
            else
            st=mijl+1;
    }

    return mijl;
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        if(a==0)
            fout<<zero(v,n,b)<<'\n';

        if(a==1)
            fout<<bsearch1(1,n,b)<<'\n';

        if(a==2)
            fout<<doi(v,n,b)<<'\n';
    }
    return 0;
}