#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,i,c,x,a[100001],L,U;

int main()
{

    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);

    scanf("%d",&n);
    for(i=1;i<=n;i++)
    scanf("%d",&a[i]);
    scanf("%d",&m);
    for(;m;m--)
    {
        scanf("%d%d",&c,&x);
        L = lower_bound(a+1,a+n+1,x)-a;
        U = upper_bound(a+1,a+n+1,x)-a;
        if(c==0)
        {
            if(L==U)
                printf("-1\n");
            else
                printf("%d\n",U-1);
        }
        else
        if(c==1)
            printf("%d\n",U-1);
        else printf("%d\n",L);

    }
    return 0;
}