#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,i,nr,x,a[100000],up,low,bin;
int main()
{
    f>>n;
    for (i=1; i<=n; i++) f>>a[i];
    f>>m;
    for(i=1; i<=m; i++)
    {
        f>>nr>>x;
        bin=binary_search(a+1,a+n+1,x);
        up=upper_bound(a+1,a+n+1,x)-a-1;
        low=lower_bound(a+1,a+n+1,x)-a;
        if (nr==0)
            if (bin) g<<up<<"\n";
            else g<<"-1"<<"\n";
        if (nr==1) g<<up<<"\n";
        if (nr==2) g<<low<<"\n";
    }
    g.close();
    return 0;
}