#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");

int n,m,a[100100],tip,val,p;
int main()
{
    f>>n;
    for(int i=1;i<=n;++i) f>>a[i];
    f>>m;
    for(int i=1;i<=m;++i){
        f>>tip>>val;
        if(tip==0){
            p=upper_bound(a+1,a+n+1,val)-a-1;
            if(a[p]!=val) g<<-1<<'\n';
            else g<<p<<'\n';
        }
        else if(tip==1){
            p=lower_bound(a+1,a+n+1,val+1)-a-1;
            g<<p<<'\n';
        }
        else {
            p=upper_bound(a+1,a+n+1,val-1)-a;
            g<<p<<'\n';
        }
    }

}