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

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

int n, v[1000005];

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


    int m; fin >> m;

    for (int i = 1; i <= m; i++)
    {
        int cerinta, x;
        fin >> cerinta >> x;

        if (cerinta == 0)
        {
            int st = 1;
            int dr = n + 1;

            while (st < dr)
            {
                int mij = (st + dr) / 2;
                if (x + 1 <= v[mij]) // x se afla in partea stanga
                    dr = mij;
                else // x se afla in partea dreapta
                    st = mij + 1;
            }
            if (v[st - 1] == x)
                fout << st - 1 << endl;
            else fout << -1 << endl;
        }
        else if (cerinta == 1)
        {
            int st = 1;
            int dr = n + 1;

            while (st < dr)
            {
                int mij = (st + dr) / 2;
                if (x + 1 <= v[mij]) // x se afla in partea stanga
                    dr = mij;
                else // x se afla in partea dreapta
                    st = mij + 1;
            }
            fout << st - 1 << endl;
        }
        else if (cerinta == 2)
        {
            int st = 1;
            int dr = n;
            while(st < dr)
            {
                int mij = (st + dr) / 2;
                if(x <= v[mij]) // x se afla in partea stanga
                    dr = mij;
                else // x se afla in partea dreapta
                    st = mij + 1;
            }
            fout << st << endl;
        }
    }
    return 0;
}