#include <fstream>

using namespace std;

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

int v[100001];

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;
    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;
    in >> n;
    for (i = 1; i <= n; ++ i)
        in >> v[i];
    in >> m;
    for (i = 1; i <= m; ++i)
    {
          in >> tip >> val;
          if (tip == 0)
             out << bsearch0(1, n, val);
          if (tip == 1)
             out << bsearch1(1, n, val);
          if (tip == 2)
             out << bsearch2(1, n, val);
        out << '\n';
    }
    return 0;
}