#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100001],a,b,n,m;
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()
{
    f>>n;
    for(int i=1; i<=n; i++)
        f>>v[i];
    f>>m;
    for(int i=1; i<=m; i++)
    {
        f>>a>>b;
        if (a == 0)
              g<<bsearch0(1, n, b)<<'\n';
          if (a == 1)
             g<<bsearch1(1, n, b)<<'\n';
          if (a == 2)
             g<<bsearch2(1, n, b)<<'\n';
    }
}