#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int cb0(int val, int v[], int left, int right)
{
    int pos, mid;
    pos = -1;
    while (left <= right)
    {
        mid = (left + right) / 2;
        if (v[mid] <= val)
        {
            if (v[mid] == val)
                pos = mid;
            left = mid + 1;
        }
        else right = mid - 1;
    }
    return pos;
}
int cb1(int val, int v[], int left, int right)
{
    int pos, mid;
    pos = -1;
    while (left <= right)
    {
        mid = (left + right) / 2;
        if (v[mid] <= val)
        {
            pos = mid;
            left  = mid+1;
        }
        else right = mid - 1;
    }
    return pos;
}
int cb2(int val, int v[], int left, int right)
{
    int pos, mid;
    pos = -1;
    while (left <= right)
    {
        mid = (left + right) / 2;
        if (v[mid] >= val)
        {
            pos = mid;
            right = mid -1;
        }
        else left = mid + 1;
    }
    return pos;
}
int main()
{
    int v[100001],q,n,x,a,b;
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    fin>>q;
    while(q--)
    {
        fin>>a>>b;
        if(a==0) fout<<cb0(b,v,1,n)<<"\n";
        if(a==1) fout<<cb0(b,v,1,n)<<"\n";
        else if(a==2) fout<<cb1(b,v,1,n)<<"\n";

    }
}