#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");

int N, a[100005], M, tip, x;

int bsearch0(int val)
{
    int sol=-1, st=1, dr=N;
    while (st<=dr)
    {
        int mij=(dr+st)/2;
        if (a[mij]==val)
        {
            if (a[mij+1]!=val) return mij;
                else st=mij+1;
        }
        else if (a[mij]>val) st=mij+1;
                else dr=mij-1;
    }
    return sol;
}

int bsearch1(int val)
{
    int sol, st=1, dr=N;
    while (st<=dr)
    {
        int mij=(dr+st)/2;
        if (a[mij]<=val) sol=mij, st=mij+1;
            else dr=mij-1;
    }
    return sol;
}

int bsearch2(int val)
{
    int sol, st=1, dr=N;
    while (st<=dr)
    {
        int mij=(dr+st)/2;
        if (a[mij]>=val) sol=mij, dr=mij-1;
            else st=mij+1;
    }
    return sol;
}

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i) f>>a[i];
    f>>M;
    for (int i=1; i<=M; ++i)
    {
        f>>tip>>x;
        if (tip==0) g<<bsearch0(x)<<'\n';
            else if (tip==1) g<<bsearch1(x)<<'\n';
                    else g<<bsearch2(x)<<'\n';
    }
    return 0;
}