#include<fstream>
using namespace std;

int n,i,v[100005],m,op,x;

ifstream f("cautbin.in");
ofstream g("cautbin.out");

int caut(int x)
{
    int ls=1,ld=n;
    while(ls<=ld)
    {
        int m=(ls+ld)/2;
        if(x<v[m]) ld=m-1;
        else if(x>v[m]) ls=m+1;
        else
        {
            if(x==v[m] && v[m+1]!=x) return m;
            else if(x==v[m] && v[m+1]==x) ls=m+1;
        }
    }
    return -1;
}

int caut_min(int x)
{
    int ls=1,ld=n;
    while(ls<=ld)
    {
        int m=(ls+ld)/2;
        if(v[m]<=x && v[m+1]>x) return m;
        else if(v[m]>x) ld=m-1;
        else if(v[m]<=x && v[m+1]<=x) ls=m+1;
    }
    return -1;
}

int caut_max(int x)
{
    int ls=1,ld=n;
    while(ls<=ld)
    {
        int m=(ls+ld)/2;
        if(v[m]>=x && v[m-1]<x) return m;
        else if(v[m]<x) ls=m+1;
        else if(v[m]>=x && v[m-1]>=x) ld=m-1;
    }
    return -1;
}

int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i];

    f>>m;
    for(i=1;i<=m;i++)
    {
        f>>op>>x;
        if(op==0)
            g<<caut(x)<<"\n";
        else if(op==1)
            g<<caut_min(x)<<"\n";
        else
            g<<caut_max(x)<<"\n";
    }

    f.close();
    g.close();
    return 0;
}