#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod=1000000007;
ll const md=998244353;
ll mypowr(ll a,ll b) {ll res=1;a%=mod; assert(b>=0);
for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll mypow(ll a,ll b) {ll res=1;assert(b>=0);
for(;b;b>>=1){if(b&1)res=res*a;a=a*a;}return res;}
ifstream in("cautbin.in");
ofstream out("cautbin.out");
#define mp make_pair
#define pb push_back
#define pf push_front
#define fi first
#define se second

ll f[100005];

int main()
{   cout<<fixed<<setprecision(12);
    cin.tie(0);cout.tie(0);
    ios_base::sync_with_stdio(0);

    ll n;
    in>>n;
    for(int i=1;i<=n;++i){
        in>>f[i];
    }
    ll k;in>>k;
    while(k--){
        ll a,x;in>>a>>x;
        if(a==0){
            int u=upper_bound(f+1,f+n+1,x)-f;
            if(u>n)--u;
            if(f[u]>x)--u;
            if(f[u]==x)out<<u<<'\n';
            else out<<"-1\n";
        }
        if(a==1){
            int u=lower_bound(f+1,f+n+1,x)-f;
            if(u>n)--u;
            if(f[u]>x)--u;
            out<<u<<'\n';
        }
        if(a==2){
            int u=lower_bound(f+1,f+n+1,x)-f;
            if(f[u]<x)++u;
            out<<u<<'\n';
        }
    }






    return 0;
}