#include <bits/stdc++.h>
using namespace std;

int cer1(int x, int st, int dr, int a[]) {
    int mij, poz = -1;
    while (st <= dr && poz == -1) {
        mij = (st + dr) / 2;
        if (x == a[mij]) poz = mij;
        else if (x < a[mij]) dr = mij - 1;
        else st = mij + 1;
    }
    return poz;
}

int cer2(int x, int st, int dr, int a[]) {
    int mij, poz = -1;
    while (st <= dr) {
        mij = (st + dr) / 2;
        if (a[mij] <= x) { poz = mij; st = mij + 1; }
        else dr = mij - 1;
    }
    return poz;
}

int cer3(int x, int st, int dr, int a[]) {
    int mij, poz = -1;
    while (st <= dr) {
        mij = (st + dr) / 2;
        if (x <= a[mij]) { poz = mij; dr = mij - 1; }
        else st = mij + 1;
    }
    return poz;
}
ifstream ci("cautbin.in");
ofstream cou("cautbin.out");
int n, m, a[100005];
int main() {
    ci >> n;
    for (int i = 1; i <= n; i++)
    ci >> a[i];
    ci >> m;
    while (m--) {
        int tip, x;
        ci >> tip >> x;
        if (tip == 0) cou << cer1(x, 1, n, a) << "\n";
        if (tip == 1) cou << cer2(x, 1, n, a) << "\n";
        if (tip == 2) cou << cer3(x, 1, n, a) << "\n";
    }

    return 0;
}