#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("cautbin.in");
ofstream g ("cautbin.out");
int n,i,v[100003],t,a,b,p;
int main()
{
    f>>n;
    for(i=1;i<=n;++i) f>>v[i];
    f>>t;
    for(i=1;i<=t;++i)
    {
        f>>a>>b;
        if(a==0)
        {
            if(!binary_search(v+1,v+n+1,b)) {g<<-1<<'\n';continue;}
            p=upper_bound(v+1,v+n+1,b)-v;
            --p;
            g<<p<<'\n';
        }
        else if(a==1)
        {
            p=upper_bound(v+1,v+n+1,b)-v;
            if(binary_search(v+1,v+n+1,b)) --p;
            g<<p<<'\n';
        }
        else
        {
            p=lower_bound(v+1,v+n+1,b)-v;
            g<<p<<'\n';
        }
    }
    return 0;
}