#include <cstdio>
#include <algorithm>
#define MAX 100001
using namespace std;
int a[MAX],n,m;

int main(){
    int cod,x,y,*p;
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    scanf("%d",&m);
    for(int i=1;i<=m;i++){
        scanf("%d %d",&cod,&x);
        switch(cod){
            case 0: p=upper_bound(a+1,a+n+1,x);
            *(p-1)==x?printf("%d\n",p-a-1):printf("-1\n");
            break;
            case 1: p=upper_bound(a+1,a+n+1,x);
            printf("%d\n",p-a-1); break;
            case 2: p=lower_bound(a+1,a+n+1,x);
            printf("%d\n",p-a); break; }
    }
}