#include<cstdio>
#include<algorithm>
using namespace std;
int v[100010],n,m;
int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);

    scanf("%d", &n);
    int i;
    for(i=0;i<n;i++)
        scanf("%d", &v[i]);
    scanf("%d", &m);
    int a,b,x;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d", &a ,&b);
        if(a==0)
        {
            x=upper_bound(v,v+n,b)-v;
            if(v[x-1]==b)

                printf("%d\n",x);
            else
                printf("-1\n");
        }
        else
            if(a==1)
            {
                x=upper_bound(v,v+n,b)-v;
                printf("%d\n",x);
            }
            else
            if(a==2)
            {
                x=lower_bound(v,v+n,b)-v;
                printf("%d\n",x+1);
            }
    }
}