#include <bits/stdc++.h>
using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int n;
int v[100005];

int bsearch0(int p,int u,int val)
{
    int m;
    while(p<u)
    {
        m=(p+u)/2;
        if(v[m]<=val)
            p=m+1;
        else
            u=m-1;
    }
    m=(p+u)/2;
    if(v[m]>=val) m--;
    if(v[m]==val) return m;
    return -1;
}

int bsearch1(int p,int u,int val)
{
    int m;
    while(p<u)
    {
        m=(p+u)/2;
        if(v[m]<=val)
            p=m+1;
        else
            u=m;
    }
    m=(p+u)/2;
    if(v[m]>val) m--;
    return m;
}

int bsearch2(int p,int u,int val)
{
    int m;
    while(p<u)
    {
        m=(p+u)/2;
        if(v[m]<val)
            p=m+1;
        else
            u=m;
    }
    m=(p+u)/2;
    if(v[m]<val)m++;
    return m;
}

int main()
{
    ios::sync_with_stdio(0);
    fin.tie(0);
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    int k,cod,val;
    fin>>k;
    for(int i=1;i<=k;i++)
    {
        fin>>cod>>val;
        if(cod==0) fout<<bsearch0(1,n,val)<<"\n";
        else if(cod==1) fout<<bsearch1(1,n,val)<<"\n";
        else if(cod==2) fout<<bsearch2(1,n,val)<<"\n";
    }
    return 0;
}