#include <cstdio>
#include <algorithm>
using namespace std;


long x,n,m,a,b,v[100001];


int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    int i;
    scanf("%ld", &n);
    for(i=0;i<n;i++) scanf("%ld", &v[i]);
    scanf("%ld", &m);
    for(i=0;i<m;i++)
    {
                    scanf("%ld %ld", &a,&b);
                    if(a==0)
                    {
                            long up=upper_bound(v,v+n,b)-v;
                            if(v[up-1]==b) printf("%ld\n", up);
                            else printf("-1\n");
                    }
                    if(a==1)
                    {
                            long up=upper_bound(v,v+n,b)-v;
                            printf("%ld\n", up);
                    }
                    if(a==2)
                    {
                            long low=lower_bound(v,v+n,b)-v+1;
                            printf("%ld\n", low);
                    }
    }
    scanf("%i", &i);
    return 0;
}