#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define double long double;
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX

int n, m, a[100005];

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

void solve()
{
    fin>>n;
    for(ll i=1;i<=n;i++)
        fin>>a[i];
    fin>>m;
    while(m--)
    {
        int c, x;
        fin>>c>>x;
        if(c==0)
        {
            int l=1, r=n, mid, ans=-1;
            while(l<=r)
            {
                mid=(l+r)/2;
                if(a[mid]<x){l=mid+1;}
                else if(a[mid]>x){r=mid-1;}
                else{ans=mid;l=mid+1;}
            }
            fout<<ans<<endl;
        }
        if(c==1)
        {
            int l=1, r=n, mid, ans=1;
            while(l<=r)
            {
                mid=(l+r)/2;
                if(a[mid]<=x){ans=mid;l=mid+1;}
                else{r=mid-1;}
            }
            fout<<ans<<endl;
        }
        if(c==2)
        {
            int l=1, r=n, mid, ans=n;
            while(l<=r)
            {
                mid=(l+r)/2;
                if(a[mid]>=x){ans=mid;r=mid-1;}
                else{l=mid+1;}
            }
            fout<<ans<<endl;
        }
    }
}

int32_t main()
{
    //ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}