#include <iostream>
#include <fstream>

using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100002],n;

int cautare_bin0(int nrc)
{
    int st,dr,mid;
    st=0;
    dr=n-1;
    while(st<dr)
    {
        mid=st+(dr-st+1)/2;
        if(nrc<v[mid])
            dr=mid-1;
        else
            st=mid;
    }
    if(v[st]==nrc)
        return ++st;
    else
        return -1;
}



int cautare_bin1(int nrc)
{
    int st,dr,mid;
    st=0;
    dr=n-1;
    while(st<dr)
    {
        mid=st+(dr-st+1)/2;
        if(nrc<v[mid])
            dr=mid-1;
        else
            st=mid;

    }
    return ++st;
}



int cautare_bin2(int nrc)
{
    int st,dr,mid;
    st=0;
    dr=n-1;
    while(st<dr)
    {
        mid=st+(dr-st)/2;
        if(nrc>v[mid])
            st=mid+1;
        else
            dr=mid;
    }
    return ++st;
}



int main()
{
    int m,i,q,x;
    f>>n;
    for(i=0;i<n;i++)
        f>>v[i];
    f>>m;
    for(i=0;i<m;i++)
    {
        f>>q>>x;
        switch (q)
        {
        case 0:
            g<<cautare_bin0(x)<<endl;
            break;
        case 1:
            g<<cautare_bin1(x)<<endl;
            break;
        case 2:
            g<<cautare_bin2(x)<<endl;
            break;
        }
    }
    return 0;
}