#include <fstream>
using namespace std;

int n, m, a,b,v[100005];
ifstream f("cautbin.in");
ofstream g("cautbin.out");

inline int search0(int x)
{
    int st, dr, mij, max=-1;

    for (st = 1, dr = n; st <= dr; )
    {
        mij = st + (dr-st) / 2;
        if (x < v[mij]) dr = mij-1;
        else if (v[mij] < x) st = mij+1;
        else max = mij, st = mij+1;
    }
    return max;
}

inline int search1(int x)
{
    int st, dr, mij, max = 0;

    for (st = 1, dr = n; st <= dr; )
    {
        mij = st + (dr-st) / 2;
        if (v[mij] <= x) max = mij, st = mij+1;
        else dr = mij-1;
    }
    return max;
}

inline int search2(int x)
{
    int st, dr, mij, min = n+1;

    for (st = 1, dr = n; st <= dr; )
    {
        mij = st + (dr-st) / 2;
        if (x <= v[mij]) min = mij, dr = mij-1;
        else st = mij+1;
    }
    return min;
}

void citire()
{
    int i;

    f>>n;
    for (i = 1; i <= n; ++i)
        f>>v[i];
}
void solve()
{
    f>>m;
    for (;m;m--)
    {
        f>>a>>b;
        switch (a){
        case 0 : {g<<search0(b)<<"\n";break;}
        case 1 : {g<<search1(b)<<"\n";break;}
        case 2 : {g<<search2(b)<<"\n";break;}}
    }
}
int main()
{
    citire();
    solve();
    f.close();
    g.close();
    return 0;
}