#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100100;

int numere[NMAX];
int n, m, x;

void citire() {
    fin >> n;
    for(int i = 0; i < n; i++) {
        fin >> numere[i];
        //cout << numere[i] << endl;
    }
}

inline int tip0iterativ() {
    int st = 0, dr = n - 1;
    int mid, last = dr + 1;
    while(st <= dr) {
        mid = (st + dr) / 2;
        if(numere[mid] <= x) {
            st = mid + 1;
            last = mid;
        } else dr = mid - 1;
    }

    if(numere[last] == x)
        return last;
    else return -2;
}

inline int tip1iterativ() {
    int st = 0, dr = n - 1;
    int mid, last = dr + 1;
    while(st <= dr) {
        mid = (st + dr) / 2;
        if(numere[mid] <= x) {
            st = mid + 1;
            last = mid;
        } else
            dr = mid - 1;
    }
    if(numere[last] <= x)
        return last;
}

inline int tip2iterativ() {
    int st = 0, dr = n - 1;
    int mid, last = dr + 1;
    while(st <= dr) {
        mid = (st + dr) / 2;
        if(numere[mid] < x)
            st = mid + 1;
        else {
            last = mid;
            dr = mid - 1;
        }
    }
    if(numere[last] >= x)
        return last;
}

void rezolvare() {
    fin >> m;
    short tip;
    for(int i = 0; i < m; i++) {
        fin >> tip;
        fin >> x;
        if(tip == 0)
            fout << tip0iterativ() + 1 << endl;
        if(tip == 1)
            fout << tip1iterativ() + 1 << endl;
        if(tip == 2)
            fout << tip2iterativ() + 1 << endl;
    }
}



int main() {

    citire();
    rezolvare();

    return 0;
}