#include <iostream>
#include <fstream>
#include <algorithm>

#define VMAX    100001

using namespace std;

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

int st, dr, mid; // CAUTARE BINARA
int  v[VMAX], n, m, q, a, i;

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

    sort (v+1, v+n+1);

    fin >> m;
    for (i=1; i<=m; i++) {

        q = -1;
        a = -1;
        st = -1;
        dr = -1;
        mid = -1;

        fin >> q >> a;
        if ( q == 0 ) {
            st = v[1]; dr = v[n];

            while ( st <= dr ) {
                mid = st+(dr-st)/2;

                if (a == v[mid]) {
                    st = mid + 1;
                }
                else {
                    dr = mid - 1;
                }
            }
            if ( v[dr] == a )
                fout << dr << '\n';
            else
                fout << "-1" << '\n';
        }
        if ( q == 1 ) {
            st = v[1]; dr = v[n];
            while ( st <= dr ) {
                mid = st+(dr-st)/2;

                if (a >= v[mid])
                    st = mid + 1;
                else
                    dr = mid - 1;
            }
            fout << dr << '\n';
        }
        if ( q == 2 ) {
            st = v[1]; dr = v[n];
            while ( st <= dr ) {
                mid = st+(dr-st)/2;

                if (a <= v[mid])
                    dr = mid - 1;
                else
                    st = mid + 1;
            }
            fout << st << '\n';
        }
    }
    return 0;
}