#include <stdio.h>
#include <stdlib.h>

int solve0 (int v[], int val, int hi)
{
    int lo, mid;
    lo = 1;
    while (lo <= hi)
    {
        mid = lo + (hi-lo)/2;
        if (v[mid] <= val) lo = mid + 1;
        else hi = mid - 1;
    }
    mid = lo + (hi-lo)/2;
    if (v[mid] > val) mid--;
    if (v[mid] == val) return mid;
    return -1;
}


int solve1 (int v[], int val, int hi)
{
int lo, mid;
    lo = 1;
    while (lo <= hi)
    {
        mid = lo + (hi-lo)/2;
        if (v[mid] <= val) lo = mid + 1;
        else hi = mid - 1;
    }
    mid = lo + (hi-lo)/2;
    if (v[mid] > val) mid--;
    return mid;
}
int solve2 (int v[], int val, int hi)
{
    int lo, mid;
    lo = 1;
    while (lo <= hi)
    {
        mid = lo + (hi-lo)/2;
        if (v[mid] < val) lo = mid + 1;
        else hi = mid - 1;
    }
    mid = lo + (hi-lo)/2;
    if (v[mid] < val) mid++;
    return mid;
}

int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    int n,i;
    int v[100010];
    scanf("%d",&n);

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

    int m,tip,val;
    scanf("%d", &m);
    while (m--)
    {
        scanf("%d %d", &tip, &val);
        if (tip == 0)
            printf("%d\n", solve0(v, val, n));
        if (tip == 1)
            printf("%d\n", solve1(v, val, n));
        if (tip == 2)
            printf("%d\n", solve2(v, val, n));
    }



    return 0;

}