#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,j,n,v[100001],a,b,M,t;
bool ok;
int main()
{
    f>>n;
    for(i=1;i<=n;++i) f>>v[i];
    f>>M;
    for(j=1;j<=M;++j){
        ok=0;
        f>>a>>b;
        if(a==0){
            for(i=1;i<=n;++i){
                if(v[i]==b){
                    t=i;
                    ok=1;
                }
            }
            if(ok) g<<t<<endl;
            else g<<-1<<endl;
        }
        else if(a==1){
            for(i=n;i>=1&&!ok;--i){
                if(v[i]<=b) {t=i;ok=1;}
            }
            g<<t<<endl;
        }
        else{
            for(i=1;i<=n&&!ok;++i){
                if(v[i]>=b){
                    t=i;
                    ok=1;
                }
            }
            g<<t<<endl;
        }
    }
    return 0;
}