#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define NMax 100100

int a[NMax];

using namespace std;
int main()
{
    int n,i,t,x,q,m;
    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(i=1;i<=m;i++)
    {
        scanf("%d %d",&t,&x);
        if(t==0)
        {
            q=lower_bound(a+1,a+n+1,x+1) - a - 1 ;
            if((q<=n) && (q>=1) && a[q]==x)
                printf("%d\n",q);
            else printf("-1\n");
        }
        else if(t==1)
        {
            q=lower_bound(a+1,a+n+1,x+1) - a - 1 ;
            printf("%d\n",q);
        }
        else
        {
            q=lower_bound(a+1,a+n+1,x) - a ;
            printf("%d\n",q);
        }

    }
}