#include <stdio.h>
using namespace std;

#define nmax 100005
int n, m, st, dr, mij, poz, cer, x;
int v[nmax];


void cautare0(int x){
    poz=-1;
    st=1; dr=n;
    while (st<=dr){
        mij=(st+dr)/2;
        if (v[mij]==x)
            poz=mij;
        if (v[mij]<=x)
            st = mij+1;
        else
            dr = mij-1;
    }
}

void cautare1(int x){
    poz=-1;
    st=1; dr=n;
    while (st<=dr){
        mij=(st+dr)/2;
        if (v[mij]<=x){
            st = mij+1;
            poz = mij;
        }
        else
            dr = mij-1;
    }
}

void cautare2(int x){
    poz=-1;
    st=1; dr=n;
    while (st<=dr){
        mij=(st+dr)/2;
         if (v[mij]>=x){
            dr = mij-1;
            poz = mij;
         }
        else
            st = mij+1;
    }
}

int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    scanf("%d",&m);
    for (int i=1;i<=m;i++){
        scanf("%d %d",&cer,&x);
        if (cer==0)
            cautare0(x);
        if (cer==1)
            cautare1(x);
        if (cer==2)
            cautare2(x);
         printf("%d\n",poz);
    }
    return 0;
}