#include <cstdio>
using namespace std;

int v[100001];


int bsearch0(int st, int dr, int x)
{
    int m;
    while(st<=dr)
    {
        m=(st+dr)/2;
        if(v[m]<=x)
            st=m+1;
        else
            dr=m-1;
    }

    m=(st+dr)/2;

    if(v[m]>x)
        m--;
    if(v[m]==x)
        return m;
    else
        return -1;
}

int bsearch1(int st, int dr, int x)
{
    int m;
    while(st<=dr)
    {
        m=(st+dr)/2;
        if(v[m]<=x)
            st=m+1;
        else
            dr=m-1;
    }

    while(v[m]>x)
        m--;
    return m;
}

int bsearch2(int st, int dr, int x)
{
    int m;
    while(st<=dr)
    {
        m=(st+dr)/2;
        if(v[m]>=x)
            dr=m-1;
        else
            st=m+1;
    }

    m=(st+dr)/2;

    while(v[m]<x)
        m++;

    return m;
}

int main()
{
    int m, n, g;

    freopen("cautbin.in", "r", stdin);

    scanf("%d", &n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d", &v[i]);
    }
    scanf("%d", &m);

    freopen("cautbin.out", "w", stdout);

    int t;
    for(int i=0;i<m;i++)
    {
        scanf("%d%d", &t, &g);
        switch(t)
        {
            case 0: printf("%d\n",bsearch0(0, n, g)); break;
            case 1: printf("%d\n",bsearch1(0, n, g)); break;
            case 2: printf("%d\n",bsearch2(0, n, g)); break;
        }
    }


    return 0;
}