#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, v[100001], m, fr[250000000];
int solve1(int x) {
    int st = 1, dr = n;
    while (st < dr) {
        int mij = (st + dr) / 2;
        if (v[mij] < x)
            st = mij + 1;
        else
            dr = mij;
    }
    if (v[st] == x){
        while (st + 1 <= n && v[st + 1] == x)
            st++;
        return st;
    }
    return -1;
}

int solve2(int x) {
    int st = 1, dr = n;
    if (!fr[x])
        x--;
    while (st < dr) {
        int mij = (st + dr) / 2;
        if (v[mij] < x)
            st = mij + 1;
        else
            dr = mij;
    }
    if (v[st] == x){
        while (st + 1 <= n && v[st + 1] == x)
            st++;
        return st;
    }
}

int solve3(int x) {
    int st = 1, dr = n;
    if (!fr[x])
        x++;
    while (st < dr) {
        int mij = (st + dr) / 2;
        if (v[mij] < x)
            st = mij + 1;
        else
            dr = mij;
    }
    return st;
}
int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    fin >> m;
    for (int i = 1; i <= m; i++) {
        int q, x;
        fin >> q >> x;
        if (q == 0){
            fr[x] = 1;
            fout << solve1(x) << '\n';
            fr[x] = 0;
        }
        if (q == 1){
            fr[x] = 1;
            fout << solve2(x) << '\n';
            fr[x] = 0;
        }
        if (q == 2){
            fr[x] = 1;
            fout << solve3(x) << '\n';
            fr[x] = 0;
        }
    }
    return 0;
}