#include <fstream>

using namespace std;

ifstream fin ("cautbin.in");
ofstream fout("cautbin.out");
int v[100010];
int st, dr, mid, t, x, i, n, m;
int main() {
    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for (i=1;i<=m;i++) {
        fin>>t>>x;
        if (t == 0) {
            //cea mai mare pozitie pe care se afla un element cu
            //valoarea x
            //sau -1 daca aceasta valoare nu se gaseste in sir
            //<=x
            //>x
            st = 1;
            dr = n;
            while (st <= dr) {
                int mid = (st + dr)/2;
                if (v[mid] <= x)
                    st = mid+1;
                else
                    dr = mid-1;
            }
            if (v[dr] == x)
                fout<<dr<<"\n";
            else
                fout<<"-1\n";

        }
        if (t == 1) {
            st = 1;
            dr = n;
            while (st <= dr) {
                int mid = (st + dr)/2;
                if (v[mid] <= x)
                    st = mid+1;
                else
                    dr = mid-1;
            }

            fout<<dr<<"\n";

        }
        if (t == 2) {
            st = 1;
            dr = n;
            while (st <= dr) {
                int mid = (st + dr)/2;
                if (v[mid] < x)
                    st = mid+1;
                else
                    dr = mid-1;
            }

            fout<<st<<"\n";
        }
    }

    return 0;
}