#include <fstream>

#define MAXN 100005

using namespace std;

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

int v[MAXN], N;

inline int binarySearch(int tip, int val) {
    int step, ii;
    for (step = 1; step <= N; step <<= 1);

    for (ii = 0; step; step >>= 1) {
        if (ii + step <= N) {
            if (v[ii + step] <= val){
                ii += step;
            }
        }
    }
    if (tip == 0 && v[ii] != val)
        ii = -1;
    if (tip == 2 && v[ii] != val + 1 && v[ii + 1] == val + 1)
        ii++;
    return ii;
}

inline void Read() {
    int M, x, tip;

    fin >> N;

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

    fin >> M;

    for (int i = 1; i <= M; i++) {
        fin >> tip >> x;
        if (tip == 2)
            fout << binarySearch(tip, x - 1) << "\n";
        else
            fout << binarySearch(tip, x) << "\n";
    }
}

int main () {
    Read();

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