#include <fstream>
using namespace std;
#define N 100010

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

int v[N];

int search (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 search2 (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 search3 (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<<search(1,n,val);
        if (tip == 1)
            g<<search2(1,n,val);
        if (tip == 2)
            g<<search3(1,n,val);
    }
    return 0;
}