#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

const int NMAX = 100000;

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(v[mij] <= x){
            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(v[mij] >= x){
            poz = mij;
            dr = mij - 1;
        }
        else {
            st = mij + 1;
        }
    }
    return poz;
}

int main()
{
    int m, x, t;

    fin >> n;
    for(int i = 1; i <= n; ++i){
        fin >> v[i];
    }
    fin >> m;
    while(m--){
        fin >> t >> x;
        switch(t){
            case 0:
                fout << caut0(x) << '\n';
                break;
            case 1:
                fout << caut1(x) << '\n';
                break;
            case 2:
                fout << caut2(x) << '\n';
                //break;
        }
    }

    fin.close();
    fout.close();

    return 0;
}