///http://www.infoarena.ro/job_detail/394150?action=view-source
///http://www.infoarena.ro/problema/cautbin
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define N 100010
using namespace std;
int v[N];//={0,1,1,1,2,3,3,3,5,5,5,7};

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 bsearch_ultim (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-1;
    }
    if (v[u] < key)
       ++ u;
    return u;
}

int bsearch_prim (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;
    }
    if (v[p] < key)
       ++ p;
    return p;
}

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", bsearch_ultim(1, n, val));
          if (tip == 2)
             printf("%d\n", bsearch_prim(1, n, val));
    }
    exit(0);
}