#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")

using namespace std;

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

const int MAX_N = 100005;
int n;
int v[MAX_N];

const int MAX_Q = 100005;
int qcnt;
struct query{
    int tip;
    int val;
}q;

int crt, nxt, add;

int main (){
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr), fout.tie(nullptr);

    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    v[0] = -1;

    fin>>qcnt;
    while(qcnt--){
        fin>>q.tip>>q.val;

        if(q.tip == 0){ /// 0
            crt = 0;
            add = (1 << (int)(ceil(log2(n))));
            while(add != 0){
                nxt = (crt | add);
                if(nxt <= n && v[nxt] <= q.val)
                    crt = nxt;
                add >>= 1;
            }
            if(v[crt] != q.val)
                fout<<"-1\n";
            else
                fout<<crt<<"\n";

        }else if(q.tip == 1){ /// 1
            crt = 0;
            add = (1 << (int)(ceil(log2(n))));
            while(add != 0){
                nxt = (crt | add);
                if(nxt <= n && v[nxt] <= q.val)
                    crt = nxt;
                add >>= 1;
            }
            fout<<crt<<"\n";

        }else{ /// 2
            crt = 0;
            add = (1 << (int)(ceil(log2(n))));
            while(add != 0){
                nxt = (crt | add);
                if(nxt <= n && v[nxt] < q.val)
                    crt = nxt;
                add >>= 1;
            }
            fout<<crt+1<<"\n";
        }
    }
    return 0;
}