#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 100000;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, v[NMAX + 1];
int caut0(int x)
{
    int st = 1, dr = n, mij, poz = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(v[mij] == x)
        {
            poz = mij;
            st = mij + 1;
        }
        else
            if(v[mij] > x)
                dr = mij - 1;
            else
                st = mij + 1;
    }
    return poz;
}
int caut1(int x)
{
    int st = 1, dr = n, mij, poz = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(x >= v[mij])
        {
            poz = mij;
            st = mij + 1;
        }
        else
            dr = mij - 1;
    }
    return poz;
}
int caut2(int x)
{
    int st = 1, dr = n, mij, poz = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(x <= v[mij])
        {
            poz = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return poz;
}
int main()
{
    int M, x, t;
    f >> n;
    for(int i = 1; i <= n; i++)
        f >> v[i];
    f >> M;
    while(M)
    {
        f >> t >> x;
        switch(t)
        {
        case 0:
            g << caut0(x) << '\n';
            break;
        case 1:
            g << caut1(x) << '\n';
            break;
        case 2:
            g << caut2(x) << '\n';
            break;
        }
        M--;
    }
    f.close();
    g.close();
    return 0;
}