#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int tip,v,m,n,a[100006];
int cautare0(int st, int dr, int x)
{
    int m;
    while(st<=dr)
    {   m=(st+dr)/2;
        if(a[m]>x) dr=m-1;
        else st=m+1;
    }
    m=(st+dr)/2;
    if(a[m]>x) m--;
    if(a[m]==x) return m;
    return -1;
}
int cautare1(int st, int dr, int x)
{
    int m;
    while(st<dr)
    {   m=(st+dr)/2;
        if(a[m]<=x) st=m+1;
        else dr=m;
    }
    m=(st+dr)/2;
    if(a[m]>x) m--;
    return m;
}
int cautare2(int st, int dr, int x)
{
    int m;
    while(st<dr)
    {
        m=(st+dr)/2;
        if(a[m]>=x) dr=m;
            else st=m+1;
    }
    m=(st+dr)/2;
    if(a[m]<x) m++;
    return m;
}
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>>v;
        if(tip==0)g<<cautare0(1,n,v)<<'\n';
         else if(tip==1)g<<cautare1(1,n,v)<<'\n';
            else g<<cautare2(1,n,v)<<'\n';
        }

    g.close();
    return 0;
}