#include <iostream>
#include <algorithm>
using namespace std;

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[100000],q,n,x,a,b;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>v[i];
    cin>>q;
    while(q--)
    {
        cin>>a>>b;
        if(a==0) cout<<cb0(b,v,1,n)<<"\n";
        if(a==1) cout<<cb1(b,v,1,n)<<"\n";
        else cout<<cb2(b,v,1,n)<<"\n";
    }
}