#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int a,i,n,val,j,k,t,nr;
int v[110000],m;
int* it;
int main()
{
f>>n;
    for (i=0;i<n;i++)
    {
    f>>v[i];
    }
    f>>m;
    for (i=1;i<=m;i++)
    {
        f>>t>>nr;
        if (t==0)
        {it=(upper_bound(v,v+n,nr)-1);if (*it==nr)g<<it-v+1<<'\n';else g<<"-1\n";}
        else if(t==1){g<<upper_bound(v,v+n,nr)-v<<'\n';}
        else {g<<lower_bound(v,v+n,nr)-v+1<<'\n';}
    }
    return 0;
}