#include <fstream>
#include <algorithm>
using namespace std;
int v[100005];
int n;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int cb0(int val)
{
int msk,pos=0,i;
for(msk=1<<20;msk>0;msk/=2)
{
    if(pos+msk<=n && v[pos+msk]<=val)
        pos+=msk;
}
if(v[pos]==val)
    return pos;
else
    return -1;
}
int cb1(int val)
{
int msk,pos=0,i;
for(msk=1<<20;msk>0;msk/=2)
{
    if(pos+msk<=n && v[pos+msk]<=val)
        pos+=msk;
}
    return pos;
}
int cb2(int val)
{   //reverse(v+1,v+n+1);
int msk,pos=0,i;
for(msk=1<<20;msk>0;msk/=2)
{
    if(pos+msk<=n && v[pos+msk]>=val)
        pos+=msk;
        while(v[pos]>=val)
            pos--;
            while(v[pos]<val)
                pos++;
}   //reverse(v+1,v+n+1);
    return pos;
}
int main()
{
    int m,i,c,x;
cin>>n;
for(i=1;i<=n;++i)
    cin>>v[i];
cin>>m;
for(i=1;i<=m;++i)
{
    cin>>c>>x;
    if(c==0)
        cout<<cb0(x)<<'\n';
    else
        if(c==1)
        cout<<cb1(x)<<'\n';
    else
        cout<<cb2(x)<<'\n';
}

    return 0;
}