#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

string file = "cautbin";
ifstream f(file + ".in");
ofstream g(file + ".out");

long long v[1001];

long long bins(long long st, long long dr, long long x)
{
    long long m = -1, res = -1;
    while (st <= dr)
    {
        m = st + (dr - st) / 2;
        if (v[m] == x)
        {
            res = m;
            st = m + 1;
        }
        else if (v[m] < x)
            st = m + 1; 
        else if (v[m] > x)
            dr = m - 1;
    }
    return res;
}

long long bins_s(long long st, long long dr, long long x)
{
    long long m = -1, res=-1;
    while (st <= dr)
    {
        m = st + (dr - st) / 2;
        if (v[m] <= x)
        {
            res = m;
            st = m + 1;
        }
        else if (v[m] > x)
            dr = m - 1;
    }
    return res;
}

long long bins_b(long long st, long long dr, long long x)
{
    long long m = -1, res = -1;
    while (st <= dr)
    {
        m = st + (dr - st) / 2;
        if (v[m] >= x)
        {
            res = m;
            dr = m - 1;
        }
        else if (v[m] < x)
            st = m + 1;
    }
    return res;
}

int main()
{
    long long n, m, c, x, maxx, i, j;
    f >> n;
    for (i = 1; i <= n; i++) f >> v[i];
    f >> m;
    for (i = 1; i <= m; i++)
    {
        f >> c >> x;
        if (c == 0)
            g << bins(1, n, x) << "\n";
        if (c == 1)
            g << bins_s(1, n, x) << "\n";
        if (c == 2)
            g << bins_b(1, n, x) << "\n";
    }
    return 0;
}