#include <fstream>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
ll v[100001];
int i0 (int r,int x)
{
    int l=1,save=-1;
    while (l<=r)
    {
        int mid=l+(r-l)/2;
        if (v[mid]==x)
            save=mid;
        if (v[mid]>x)
            r=mid-1;
        else
            l=mid+1;
    }
    return save;
}
int i1 (int r, int x)
{
    int l=1,save;
    while (l<=r)
    {
        int mid=l+(r-l)/2;
        if (v[mid]<=x)
            {
                save=mid;
                l=mid+1;
            }
        else
            r=mid-1;
    }
    return save;
}
int i2(int r,int x)
{
    int l=1,save;
    while (l<=r)
    {
        int mid=l+(r-l)/2;
        if (v[mid]>=x)
        {
            save=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    return save;
}
int main()
{
    int n;
    in>>n;
    for (int i=1;i<=n;++i)
        in>>v[i];
    int m;
    in>>m;
    for (int i=1;i<=m;++i)
    {
        int k,p;
        in>>k>>p;
        if (k==0)
            out<<i0(n,p)<<'\n';
        if (k==1)
            out<<i1(n,p)<<'\n';
        if (k==2)
            out<<i2(n,p)<<'\n';
    }
    return 0;
}