#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;

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

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

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

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

int main()
{
    int n, v[1001], x, m, indice;
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>indice>>x;
        if(indice==0)
            fout<<cautarebinara(v,n,x)<<"\n";
        if(indice==1)
            fout<<upperbound(v,n,x)<<"\n";
        if(indice==2)
            fout<<lowerbound(v,n,x)<<"\n";
    }
    return 0;
}