#include <fstream>
using namespace std;
int a[100005], n;
/// cauta daca x apare intr-un vector
/// returneaza cea mai din dreapta pozitie
int CautBin0 (int x)
{
    int st, dr, mij, p;
    st=1;
    dr=n;
    p=-1;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (a[mij]==x)
        {
            p=mij;
            st=mij+1;
        }
        else if (a[mij]<x) st=mij+1;
        else dr=mij-1;
    }
    return p;
}
int CautBin1 (int x)
{
    int st, dr, mij, p;
    st=1;
    dr=n;
    p=-1;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (a[mij]<=x)
        {
            p=mij;
            st=mij+1;
        }
        else dr=mij-1;
    }
    return p;
}
int CautBin2 (int x)
{
    int st, dr, mij, p;
    st=1;
    dr=n;
    p=-1;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (a[mij]>=x)
        {
            p=mij;
            dr=mij-1;
        }
        else st=mij+1;
    }
    return p;
}

int main()
{
    int m, x, op;
    ifstream fin ("cautbin.in");
    ofstream fout ("cautbin.out");
    fin >> n;
    for (int i =1; i<=n; i++)
        fin >> a[i];
    fin >> m;
    for (int i = 1; i<=m; i++)
    {
        fin >> op >> x;
        if (op==0) fout << CautBin0(x) << "\n";
        else if (op==1) fout << CautBin1(x) << "\n";
        else fout << CautBin2(x) << "\n";
    }
    fout.close();
    return 0;
}