#include<cstdio>
#define nmax 100010
long long v[nmax],val;
int i,st,dr,m,key,n,ok;
using namespace std;
int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d", &n);
    for(i=1;i<=n;++i)scanf("%lld", &v[i]);
    scanf("%d", &m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%lld", &key, &val);
        ok=0;
        if(key==0)
        {
            st=1;dr=n;
            for(;st<=dr&&ok==0;)
            {
                m=(st+dr)/2;
                if(v[m]==val)
                {
                    while(v[m+1]==val)++m;
                    printf("%d\n", m);
                    ok=1;
                    continue;
                }
                if(v[m]<val)st=m+1;
                else dr=m-1;
            }
            if(ok==0)printf("-1\n");
        }
        if(key==1)
        {
            st=1;dr=n;
            for(;st<=dr&&ok==0;)
            {
                m=(st+dr)/2;
                if(v[m]==val)
                {
                    while(v[m+1]==val)++m;
                    printf("%d\n", m);
                    ok=1;
                    continue;
                }
                if(v[m]<val)st=m+1;
                else dr=m-1;
            }
            if(ok==0)printf("%d\n", dr);
        }
        if(key==2)
        {
            st=1;dr=n;
            for(;st<=dr&ok==0;)
            {
                m=(st+dr)/2;
                if(v[m]==val)
                {
                    while(v[m-1]==val)--m;
                    printf("%d\n", m);
                    ok=1;
                    continue;
                }
                if(v[m]<val)st=m+1;
                else dr=m-1;
            }
            if(ok==0)printf("%d\n", st);
        }
    }
    return 0;
}