#include<fstream>
#include<iostream>
#include<cstdio>
#define maxn 100002
using namespace std;
int n, m, v[maxn];
int cauta(int x)
{
    int st=1, dr=n, mij, rez=st;
    while(st<dr)
    {
        mij=(st+dr)/2;
        if(v[mij]<=x)
            rez=mij, st=mij+1;
        else
            dr=mij-1;
    }
    return rez;
}

int cauta2(int x)
{
    int st=1, dr=n, mij, rez=st;
    while(st<dr)
    {
        mij=(st+dr)/2;
        if(v[mij]>=x)
            rez=mij, dr=mij-1;
        else
            st=mij+1;
    }
    return rez-1;
}

int main()
{
    int i, op, x, rez;
    ifstream fin("cautbin.in");
    freopen("cautbin.out", "w", stdout);
    fin>>n;
    for(i=1;i<=n;++i)
        fin>>v[i];
    fin>>m;
    for(i=1;i<=m;++i)
    {
        fin>>op>>x;
        if(!op)
        {
            rez=cauta(x);
            if(v[rez]==x)
                printf("%d\n", rez);
            else
                printf("-1\n");
        }
        else if(op==1)
            printf("%d\n", cauta(x));
        else
            printf("%d\n", cauta2(x));
    }
    return 0;
}