#include <stdio.h>
#define N 100010
int v[N];

int bsearch0 (int p, int u, int key) {
    int m;

    while (p <= u) {
        m = (p + u) / 2;
        if (v[m] <= key)
            p = m + 1;
        else
            u = m - 1;
    }
    m = (p + u) / 2;

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

int bsearch1 (int p, int u, int key) {
    int m, n = u;

    while (p < u){
        m = (p + u) / 2;
        if (v[m] <= key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] > key)
       -- m;
    return m;
}

int bsearch2 (int p, int u, int key) {
    int m;

    while (p < u) {
        m = (p + u) / 2;
        if (v[m] < key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] < key)
       ++ m;
    return m;
}

int main () {
    int i, n, m, tip, val;

    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        scanf("%d", &v[i]);

    scanf("%d", &m);

    while (m --){
          scanf("%d%d", &tip, &val);
          if (tip == 0)
             printf("%d\n", bsearch0(1, n, val));
          if (tip == 1)
             printf("%d\n", bsearch1(1, n, val));
          if (tip == 2)
             printf("%d\n", bsearch2(1, n, val));
    }
    return 0;
}

/*#include <cstdio>

using namespace std;

#define MAX 10005

int v[MAX], n;
int bsearch0(int st, int dr, int key)
{
    int mid;
    while(st <= dr)
    {
        mid = (st+dr)/2;
        if(v[mid] <= key)
            st = mid+1;
        else
            dr = mid-1;
    }
    mid = (st+dr)/2;
    if(v[mid] > key) mid--;
    if(v[mid] == key)
        return mid;
    return -1;
}
int bsearch1(int st, int dr, int key)
{
    int mid;
    while(st < dr)
    {
        mid = (st+dr)/2;
        if(v[mid] <= key)
            st = mid+1;
        else
            dr = mid;
    }
    mid = (st+dr)/2;
    if(v[mid] > key) mid--;
    return mid;
}
int bsearch2(int st, int dr, int key)
{
    int mid;
    while(st < dr)
    {
        mid = (st+dr)/2;
        if(v[mid] < key)
            st = mid+1;
        else
            dr = mid;
    }
    mid = (st+dr)/2;
    if(v[mid] < key) mid++;
    return mid;
}

int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    int i, m, cod, val;
    scanf("%d",&n);
    for(i=1; i<=n; i++)
        scanf("%d",&v[i]);
    scanf("%d",&m);
    while(m)
    {
        m--;
        scanf("%d %d",&cod, &val);
        if(cod==0)
            printf("%d\n",bsearch0(1,n,val));
        else if(cod==1)
            printf("%d\n",bsearch1(1,n,val));
        else if(cod==2)
            printf("%d\n",bsearch2(1,n,val));
    }
    return 0;
}*/