#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int v[100001];
int n;
int caut_binar (int x)
{
    int Left=1, Right=n, Sol=-1;
    while(Left<=Right)
    {
        int Mid=Right+(Left-Right)/2;
        if(v[Mid]==x)
        {
            Sol=Mid;
            break;
        }else
        if(v[Mid]<x) Left=Mid+1;
        else
            Right=Mid-1;
    }
    int csol=Sol;
    while(v[csol+1]==v[Sol])
        csol++;
    return csol;
}
int caut_binar_cea_mai_mare_poz_element_mai_mic_sau_egal_cu_x (int x)
{
    int Left=1, Right=n, Sol=-1;
    while(Left<=Right)
    {
        int Mid=Right+(Left-Right)/2;
        if(v[Mid]<=x && x<=v[Mid+1])
        {
            Sol=Mid;
            break;
        } else
        if(v[Mid]<x) Left=Mid+1;
        else
            Right=Mid-1;
    }
    int csol=Sol;
    while(v[csol+1]<=v[Sol])
        csol++;
    return csol;
}
int caut_binar_cea_mai_mica_poz_element_mai_mare_sau_egal_cu_x (int x)
{
    int Left=1, Right=n, Sol=-1;
    while(Left<=Right)
    {
        int Mid=Right+(Left-Right)/2;
        if(v[Mid]>=x && x>=v[Mid-1])
        {
            Sol=Mid;
            break;
        } else
        if(v[Mid]<x) Left=Mid+1;
        else
            Right=Mid-1;
    }
    int csol=Sol;
    while(v[csol-1]>=v[Sol])
        csol--;
    return csol;
}
int main()
{
    int m;
    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>v[i];
    fin>>m;
    for(int i=1; i<=m; i++)
    {
        short int tip_intrebare;
        int nr;
        fin>>tip_intrebare>>nr;
        if(tip_intrebare==0)
            fout<<caut_binar(nr)<<"\n";
            else
                if(tip_intrebare==1)
                fout<<caut_binar_cea_mai_mare_poz_element_mai_mic_sau_egal_cu_x(nr)<<"\n";
                else
                    fout<<caut_binar_cea_mai_mica_poz_element_mai_mare_sau_egal_cu_x(nr)<<"\n";

    }

    return 0;
}