#include <fstream>

#define MAXN 100002

using namespace std;

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

int v[MAXN], N, m;

inline int test(int val, int tip, int sum) {
    if (tip == 1 || tip == 0) {
        if (v[sum] <= val)
            return 1;
        return 0;
    }
    else {
        if (v[sum] < val)
            return 1;
        return 0;
    }
    return 0;
}

inline int search_bin(int val, int tip) {
    int step, i;

    for (step = 1; step < N; step <<= 1);
    for (i = 0; step; step >>= 1) {
        if (step + i <= N && test(val, tip, step + i))
            i += step;
    }
    return i;
}

inline void Read() {
    int val, nr, sol;

    fin >> N;

    for (int i = 1; i <= N; i++) {
        fin >> v[i];
    }

    fin >> m;

    for (int i = 1; i <= m; i++) {
        fin >> nr >> val;

        if (nr == 0) {
            sol = search_bin(val, nr);

            if (v[sol] != val)
               sol = -1;

            fout << sol << "\n";
        }
        else if (nr == 1) {
            fout << search_bin(val, nr) << "\n";
        }
        else {
            fout << search_bin(val, nr) + 1 << "\n";
        }
    }
}

int main () {
    Read();

    fin.close(); fout.close(); return 0;
}