#include <iostream>
#include <fstream>

using ull = unsigned long long;
using namespace std;

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

const int NMAX = 100100;

ull numere[NMAX];
int n;
int m;

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

int tip0iterativ(int st, int dr, ull x) {
    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;
}

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

    if(numere[last] <= x)
        return last;

}

int tip2iterativ(int st, int dr, ull x) {
    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;
}


int cautbin(short tip, ull numar) {
    if(tip == 0) {
        return tip0iterativ(0, n-1, numar);
    }
    if(tip == 1) {
        return tip1iterativ(0, n-1, numar);
    }
    if(tip == 2) {
        return tip2iterativ(0, n-1, numar);
    }
}

void rezolvare() {
    fin >> m;
    for(int i = 0; i < m; i++) {
        short tip;
        ull numar;
        fin >> tip;
        fin >> numar;
        fout << cautbin(tip, numar) + 1 << endl;
    }
}



int main() {

    citire();
    rezolvare();

    return 0;
}