#include <fstream>
using namespace std;

int a[100001], n;
int prima(int nr)
{
    int mijl, dr, st, poz;
    st = 1;
    dr = n;
    poz = -1;
    while(st <= dr)
    {
        mijl = (dr + st) / 2;
        if(nr > a[mijl])
            st = mijl + 1;
        if(nr == a[mijl])
        {
            poz = mijl;
            st = mijl + 1;
        }
        if(nr < a[mijl])
            dr = mijl - 1;
    }
    return poz;
}
int adoua(int nr)
{
    int mijl, dr, st, poz;
    st = 1;
    dr = n;
    poz = -1;
    while(st <= dr)
    {
        mijl = (dr + st) / 2;
        if(a[mijl] <= nr)
        {
            poz = mijl;
            st = mijl + 1;
        }
        else
            dr = mijl - 1;
    }
    return poz;
}
int atreia(int nr)
{
    int mijl, dr, st, poz;
    st = 1;
    dr = n;
    poz = -1;
    while(st <= dr)
    {
        mijl = (st + dr) / 2;
        if(a[mijl] >= nr)
        {
            poz = mijl;
            dr = mijl - 1;
        }
        else
            st = mijl + 1;
    }
    return poz;

}
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
    int i, m, tip, x;
    fin >> n;
    for(i = 1; i <= n; i++)
        fin >> a[i];
    fin >> m;
    for(i = 1; i <= m; i++)
    {
        fin >> tip >> x;
        if(tip == 0)
            fout << prima(x) << "\n";
        if(tip == 1)
            fout << adoua(x) << "\n";
        if(tip == 2)
            fout << atreia(x) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}