#include<cstdio>
#define MAX_N 100000
using namespace std;

int v[MAX_N+1], n, m;

inline int binarySearch0(int val)
{
    int left, right, mid, pos;
    left = 1; right = n; pos = -1;
    while(left <= right)
    {
        mid = (left + right) >> 1;
        if(v[mid] == val)
        {
            pos = mid;
            left = mid + 1;
        }
        else if(v[mid] < val)
            left = mid + 1;
        else right = mid - 1;
    }
    return pos;
}

inline int binarySearch1(int val)
{
    int left, right, mid, pos;
    left = 1; right = n; pos = -1;
    while(left <= right)
    {
        mid = (left + right) >> 1;
        if(v[mid] <= val)
        {
            pos = mid;
            left = mid + 1;
        }
        else right = mid - 1;
    }
    return pos;
}

inline int binarySearch2(int val)
{
    int left, right, mid, pos;
    left = 1; right = n; pos = -1;
    while(left <= right)
    {
        mid = (left + right) >> 1;
        if(v[mid] >= val)
        {
            pos = mid;
            right = mid - 1;
        }
        else left = mid + 1;
    }
    return pos;
}

int main()
{
    int i, x, y;
    FILE *fin, *fout;
    fin = fopen("cautbin.in","r");
    fout = fopen("cautbin.out","w");
    fscanf(fin,"%d",&n);
    for(i=1; i<=n; i++)
        fscanf(fin,"%d",&v[i]);
    fscanf(fin,"%d",&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&x,&y);
        if(x == 0) fprintf(fout,"%d\n",binarySearch0(y));
        else if(x == 1) fprintf(fout,"%d\n",binarySearch1(y));
        else fprintf(fout,"%d\n",binarySearch2(y));
    }
    fclose(fin);
    fclose(fout);
    return 0;
}