#include <iostream>
#include <fstream>
#define NMax 100001
///#define f cin
///#define g cout
using namespace std;

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

long long n, m, a[NMax], cod, x;

long long cautare_binara1(long long a[NMax], int n, long long x)
{
    int L = 0;
    int R = n - 1;
    int mxpoz = -2;
    while(L <= R)
    {
        int mid = (int)(L + R)/2;
        if(a[mid] < x) L = mid + 1;
        else if(a[mid] > x) R = mid - 1;
        else if(a[mid] == x && mid > mxpoz)
        {
            mxpoz = mid;
            L = mid + 1;
        }
    }
    return mxpoz + 1;
}

long long cautare_binara2(long long a[NMax], int n, long long x)
{
    int L = 0;
    int R = n - 1;
    int mnpoz = n;
    while(L <= R)
    {
        int mid = (int)(L + R)/2;
        if(a[mid] < x) L = mid + 1;
        else if(a[mid] >= x)
        {
            mnpoz = mid;
            R = mid - 1;
        }
    }
    return mnpoz + 1;
}

long long cautare_binara3(long long a[NMax], int n, long long x)
{
    int L = 0;
    int R = n - 1;
    int mxpoz = -2;
    while(L <= R)
    {
        int mid = (int)(L + R)/2;
        if(a[mid] <= x)
        {
            L = mid + 1;
            mxpoz = mid;
        }
        else if(a[mid] > x) R = mid - 1;
    }
    return mxpoz + 1;
}

int main()
{
    ios::sync_with_stdio(false);
    f >> n;
    for(int i = 0; i < n; ++i)
        f >> a[i];
    f >> m;
    for(int i = 0; i < m; ++i)
    {
        f >> cod >> x;
        if(cod == 0) g << cautare_binara1(a, n, x) << '\n';
        else if(cod == 1) g << cautare_binara3(a, n, x) << '\n';
        else g << cautare_binara2(a, n, x) << '\n';
    }
    return 0;
}