#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
    int n;
    fin>>n;
    int v[n+1];
    for (int i=1;i<=n;++i)
        fin>>v[i];
    int m;
    fin>>m;
    for (int i=1;i<=m;++i)
    {
        int ce,x,st,dr,y=-1,mij;
        bool g;
        fin>>ce>>x;
        switch(ce)
        {
        case 0:
            st=1;
            dr=n;
            g=false;
            while (!g && st<=dr)
            {
                mij=st+(dr-st)/2;
                if (x==v[mij] && x!=v[mij+1]) g=true,y=mij;
                else if (x>=v[mij]) st=mij+1;
                else dr=mij-1;
            }
            break;
        case 1:
            st=1;
            dr=n;
            g=false;
            while (!g && st<=dr)
            {
                mij=st+(dr-st)/2;
                if (x>=v[mij] && x!=v[mij+1]) g=true,y=mij;
                else if (x>=v[mij]) st=mij+1;
                else dr=mij-1;
            }
            break;
        case 2:
            st=1;
            dr=n;
            g=false;
            while (!g && st<=dr)
            {
                mij=st+(dr-st)/2;
                if (x<=v[mij] && x!=v[mij-1]) g=true,y=mij;
                else if (x>v[mij]) st=mij+1;
                else dr=mij-1;
            }
            break;
        }
        fout<<y<<'\n';
    }
}