#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, v[100001];
int cautbin0(int x)
{
    int s = 1, d = N, p = -1;
    while(s <= d)
    {
        int m = (s + d) / 2;
        if(x == v[m])
            p = m;
        if(x >= v[m])
            s = m + 1;
        else
            d = m - 1;
    }
    return p;
}
int cautbin1(int x)
{
    int s = 1, d = N, p = -1;
    while(s <= d)
    {
        int m = (s + d) / 2;
        if(x >= v[m])
        {
            p = m;
            s = m + 1;
        }
        else
            d = m - 1;
    }
    return p;
}
int cautbin2(int x)
{
    int s = 1, d = N, p = -1;
    while(s <= d)
    {
        int m = (s + d) / 2;
        if(x <= v[m])
        {
            p = m;
            d = m - 1;
        }
        else
            s = m + 1;
    }
    return p;
}

int main()
{
    int  x, y,M;
    f >> N;
    for(int i = 1; i <= N; i++)
        f >> v[i];
    f >> M;
    for(int i = 1; i <= M; i++)
    {
        f >> y >> x;
        switch(y)
        {
        case 0:
            g << cautbin0(x) << '\n';
            break;
        case 1:
            g << cautbin1(x) << '\n';
            break;
        case 2:
            g << cautbin2(x) << '\n';

        }
    }
    return 0;
}