#include <fstream>
#include <algorithm>
#define mod 1999999973
using namespace std;
ifstream f ("cautbin.in");
ofstream g ("cautbin.out");
int i,v[100001],a,b,x,t,n;
int main()
{
    f>>n;
    for(i=1;i<=n;++i) f>>v[i];
    sort(v+1,v+n+1);
    f>>t;
    for(i=1;i<=t;++i)
    {
        f>>a>>b;
        if(a==0)
        {
            x=upper_bound(v+1,v+n+1,b)-v-1;
            if(x>=1&&x<=n&&v[x]==b) g<<x<<'\n';
            else g<<-1<<'\n';
        }
        else if(a==1)
        {
            x=lower_bound(v+1,v+n+1,b+1)-v-1;
            g<<x<<'\n';
        }
        else
        {
            x=upper_bound(v+1,v+n+1,b-1)-v;
            g<<x<<'\n';
        }
    }
    return 0;
}