#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

const int MAX=1e5+5;
int n,m,v[MAX];

int Binary_search(int x)
{
    int st=1,dr=n,ret=-1;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(v[m]<=x)
        {
            st=m+1;
            ret=1;
        }
        else
            dr=m-1;
    }
    return (ret!=-1)?dr:ret;
}

int Lower_bound(int x)
{
    int st=1,dr=n;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(x<=v[m])
            dr=m-1;
        else
            st=m+1;
    }
    return dr;
}

int Upper_bound(int x)
{
    int st=1,dr=n,ret;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(v[m]<=x)
            st=m+1;
        else
            dr=m-1;
    }
    return dr;
}

int main()
{
    fin >> n;
    for(int i=1;i<=n;i++)
        fin >> v[i];
    fin >> m;
    while(m--)
    {
        int op,x;
        fin >> op >> x;
        switch(op)
        {
            case 0: fout << Binary_search(x);
                break;
            case 1: fout << Upper_bound(x);
                break;
            case 2: fout << Lower_bound(x);
                break;
        }
        fout << '\n';
    }
    return 0;
}