#include <iostream>
#include <stdio.h>
using namespace std;
int n,m,a[100001];

int cautbin0(int x, int p, int q)
{
    if(p>q) return -1;
    else
    {
        int m=p+(q-p)/2;
        if(a[m]==x)
            if(a[m+1]==x) return cautbin0(x,m+1,q);
            else return m;
        else
            if(x<a[m]) return cautbin0(x,p,m-1);
            else return cautbin0(x,m+1,q);
    }
}

int cautbin1(int x, int p, int q)
{
    int m=p+(q-p)/2;
    if(x==a[m])
        if(a[m+1]!=x) return m;
        else cautbin1(x,m+1,q);
    else
        if(a[m]<x)
            if(a[m+1]>=x) return m;
            else return cautbin1(x,m+1,q);
        else
            if(a[m-1]<=x) return m-1;
            else return cautbin1(x,p,m-1);
}

int cautbin2 (int x, int p, int q)
{
    int m=p+(q-p)/2;
    if(x==a[m])
        if(a[m-1]!=x) return m;
        else return cautbin2(x,p,m-1);
    else
        if(a[m]<x)
            if(a[m+1]>=x) return m+1;
            else return cautbin2(x,m+1,q);
        else
            if(a[m-1]<=x) return m;
            else return cautbin2(x,p,m-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", &a[i]);
    scanf("%d", &m);
    int tip,x;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d", &tip, &x);
        if(tip==0) printf("%d \n", cautbin0(x,1,n));
        else
            if(tip==1) printf("%d \n", cautbin1(x,1,n));
            else
                if(tip==2) printf("%d \n", cautbin2(x,1,n));
    }
    return 0;
}