#include <cstdio>
#include <algorithm>

using namespace std;

int v[100002];

int main()
{
    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);

    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &v[i]);

    sort(v+1, v+n+1);

    int m;
    scanf("%d", &m);
    int a, b;
    while (m--)
    {
        scanf("%d%d", &a, &b);
        if (a == 0)
        {
            if (binary_search(v+1, v+n+1, b))
                printf("%d\n", upper_bound(v+1, v+n+1, b)-v-1);
            else
                printf("-1\n");
        }
        if (a == 1)
            printf("%d\n", upper_bound(v+1, v+n+1, b)-v-1);
        if (a == 2)
            printf("%d\n", lower_bound(v+1, v+n+1, b)-v);
    }

    return 0;
}