#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, a[100001];
int caut(int x)
{
    int p = 1, u = N, poz = -1;
    while(p <= u)
    {
        int m = (p + u) / 2;
        if(a[m] == x)
            poz = m;
        if(x >= a[m])
            p = m + 1;
        else
            u = m - 1;
    }
    return poz;
}
int cauta(int x)
{
    int p = 1, u = N, poz = -1;
    while(p <= u)
    {
        int m = (p + u) / 2;
        if(a[m] <= x)
        {
            poz = m;
            p = m + 1;
        }
        else
            u = m - 1;
    }
    return poz;
}
int cauto(int x)
{
    int p = 1, u = N, poz = -1;
    while(p <= u)
    {
        int m = (p + u) / 2;
        if(a[m] >= x)
        {
            poz = m;
            u = m - 1;
        }
        else
            p = m + 1;
    }
    return poz;
}
int main()
{
    int M, t, x, i;
    f >> N;
    for(i = 1; i <= N; i++)
        f >> a[i];
    f >> M;
    for(i = 1; i <= M; i++)
    {
        f >> t >> x;
        switch(t)
        {
        case 0:
            g << caut(x) << '\n';
            break;
        case 1:
            g << cauta(x) << '\n';
            break;
        case 2:
            g << cauto(x) << '\n';
            //  break;
        }
    }
    return 0;
}