#include<fstream>
using namespace std;
const int N=100001;
int v[N];

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

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

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

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

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

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

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

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

int main () {
    int i, n, m, tip, val;
    ifstream fin("cautbin.in");
    ofstream fout("cautbin.out");
    fin>>n;
    for (i = 1; i <= n; ++ i)
        fin>>v[i];

    fin>>m;

    while (m --){
          fin>>tip>>val;
          if (tip == 0)
             fout<< cautbin0(1, n, val)<<'\n';
          if (tip == 1)
             fout<< cautbin1(1, n, val)<<'\n';
          if (tip == 2)
             fout<< cautbin2(1, n, val)<<'\n';
    }
    return 0;
}