#include <iostream>
#include <fstream>
using namespace std;

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

const int nmax = 1e5 + 5;
int V[nmax];

void Bsearch0 (int st, int dr, int val) {
    int mid, pos = -1;
    while (st <= dr) {
        mid = st + ((dr - st) >> 1);
        if (V[mid] <= val) {
            st = mid + 1;
            pos = mid;
        } else {
            dr = mid - 1;
        }
    }
    if (V[pos] != val) {
        fout << "-1\n";
    } else {
        fout << pos << "\n";
    }
}

void Bsearch1(int st, int dr, int val) {
    int mid, pos = -1;
    while (st <= dr) {
        mid = st + ((dr - st) >> 1);
        if (V[mid] <= val) {
            pos = mid;
            st = mid + 1;
        } else {
            dr = mid - 1;
        }
    }
    fout << pos << "\n";
}

void Bsearch2(int st, int dr, int val) {
    int mid, pos = -1;
    while (st <= dr) {
        mid = st + ((dr - st) >> 1);
        if (V[mid] >= val) {
            pos = mid;
            dr = mid - 1;
        } else {
            st = mid + 1;
        }
    }
    fout << pos << "\n";
}

int main() {
    ios_base :: sync_with_stdio (false);
    int n, m, i, op, val;
    fin >> n;
    for (i = 1; i <= n; i++) {
        fin >> V[i];
    }
    fin >> m;
    for (i = 1; i <= m; i++) {
        fin >> op >> val;
        if (op == 0) {
            Bsearch0(1, n, val);
        } else if (op == 1) {
            Bsearch1(1, n, val);
        } else {
            Bsearch2(1, n, val);
        }
    }
    fin.close();
    fout.close();
    return 0;
}