#include <fstream>
#define N 100010

using namespace std;

int v[N];


ifstream f("cautbin.in");
ofstream g("cautbin.out");

int b0 (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 b1 (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 b2 (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;
    f>>n;
    for (i = 1; i <= n; ++ i)
        f>>v[i];
    f>>m;
    while (m --){
        f>>tip>>val;
        if (tip == 0)
            g<<b0(1, n, val);
        if (tip == 1)
			g<<b1(1, n, val);
        if (tip == 2)
            g<<b2(1, n, val);
		g<<endl;
    }
}