#include <fstream>
#include <vector>
#include <algorithm>
#define f in
#define g out

using namespace std;
ifstream in ( "cautbin.in" );
ofstream out( "cautbin.out" );
int n, m, i, st, dr, mid, tip, x;
int v[100009];

int main() {
    f>>n;
    for ( i=1; i <= n; i++ )
        f>>v[i];
    for ( f>>m; m--; ) {
        f>>tip>>x;
        st = 1; dr = n;
        if ( tip == 0 ){
            while ( st <= dr ) {
                mid = st + (dr-st)/2;
                if ( v[mid] <= x )
                    st = mid+1;
                else dr = mid-1;
            }
            if ( v[dr] == x )
                g<<dr<<"\n";
            else g<<"-1\n";
            continue;
        }
        if ( tip == 1 ){
            while ( st <= dr ) {
                mid = st + (dr-st)/2;
                if ( v[mid] <= x )
                    st = mid+1;
                else dr = mid-1;
            }
            g<<dr<<"\n";
            continue;
        }
        while ( st <= dr ) {
            mid = st + (dr-st)/2;
            if ( v[mid] < x )
                st = mid+1;
            else dr = mid-1;
        }
        g<<st<<"\n";
    }
    return 0;
}