#include <fstream>
#include <string.h>
#include <vector>
#include <queue>
#include <limits.h>

#define nMax 100001
#define lgMax 19
#define pb push_back
#define INF INT_MAX
#define bit(i) i&(-i)
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m;
int v[nMax];
void read()
{
    fin>>n;

    for(int i=1;i<=n;i++)
        fin>>v[i];
}
int binary_search_val(int val)
{
    int st=1, dr=n, poz=-1;

    while(st<=dr)
    {
        int mid=st+(dr-st)/2;
        if(v[mid]<=val)
        {
            st=mid+1;
            if(v[mid]==val)
                poz=mid;
        }
        else
            dr=mid-1;
    }

    return poz;
}
int binary_search_right(int val)
{
    int st=1, dr=n, poz;

    while(st<=dr)
    {
        int mid=st+(dr-st)/2;
        if(v[mid]<=val)
        {
            poz=mid;
            st=mid+1;
        }
        else
            dr=mid-1;
    }

    return poz;
}
int binary_search_left(int val)
{
    int st=1, dr=n, poz;

    while(st<=dr)
    {
        int mid=st+(dr-st)/2;
        if(v[mid]>=val)
        {
            poz=mid;
            dr=mid-1;
        }
        else
            st=mid+1;
    }

    return poz;
}
void solve()
{
    int op, a;
    fin>>m;

    for(int i=1;i<=m;i++)
    {
        fin>>op>>a;
        switch(op)
        {
            case 0:fout<<binary_search_val(a);break;
            case 1:fout<<binary_search_right(a);break;
            case 2:fout<<binary_search_left(a);break;
        }
        fout<<'\n';
    }
}
int main()
{
    read();
    solve();
    return 0;
}