#include <bits/stdc++.h>

using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,a[100100],q,t,x,p;
int main()
{
    in>>n;
    for(int i=1;i<=n;i++) in>>a[i];
    in>>q;
    while(q--)
    {
        in>>t>>x;
        if(t==0)
        {
            p=upper_bound(a+1,a+n+1,x)-a-1;
            if(p<=n&&p>=1&&a[p]==x) out<<p<<'\n';
            else out<<-1<<'\n';
        }
        else if(t==1)
        {
           p=lower_bound(a+1,a+n+1,x+1)-a-1;
           out<<p<<'\n';
        }
        else
        {
           p=upper_bound(a+1,a+n+1,x-1)-a;
           out<<p<<'\n';
        }
    }
    return 0;
}