#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,x,a[100005],i,j,m,y,z;
int main()
{
    f>>n;
    for(i=1;i<=n;i++) f>>a[i];
    f>>m;
    while(m)
    {
        f>>x>>y;
        if(x==0)
        {
            z=upper_bound(a+1,a+n+1,y)-a;
            if(a[z-1]==y) g<<z-1;
            else g<<"-1";
            g<<'\n';

        }
        else if(x==1)
        {
            z=upper_bound(a+1,a+n+1,y)-a;
            g<<z-1<<'\n';
        }
        else
        {
            z=lower_bound(a+1,a+n+1,y)-a;
            g<<z<<'\n';
        }
        m--;
    }
    return 0;
}