#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int A[100000];

int Tip1(int numar,int st,int dr)
{
    if(st > dr)
        return -1;
    int median = st + (dr-st)/2;
    if(A[median]==numar)
    {
        while(A[median+1]==numar)
            median++;
        return median+1;
    }
    else
    {
        if(A[median]>numar)
            Tip1(numar,st,median-1);
        else
            Tip1(numar,median+1,dr);
    }
}
int Tip2(int numar,int st,int dr)
{
    int median = st + (dr-st)/2;
    if(st > dr)
        return median+1;
    if(A[median]==numar)
    {
        while(A[median+1]==numar)
            median++;
        return median+1;
    }
    else
    {
        if(A[median]>numar)
            Tip2(numar,st,median-1);
        else
            Tip2(numar,median+1,dr);
    }
}
int Tip3(int numar,int st,int dr)
{

    int median = st + (dr-st)/2;
    if(st > dr)
        return median+1;
    if(A[median]==numar)
    {
        while(A[median-1]==numar)
            median--;
        return median+1;
    }
    else
    {
        if(A[median]<numar)
            Tip3(numar,median+1,dr);
        else
            Tip3(numar,st,median-1);
    }
}
int cautBin(int tip,int numar,int st,int dr)
{
    switch(tip)
    {
    case 0:
        return Tip1(numar,st,dr);
        break;
    case 1:
        return Tip2(numar,st,dr);
        break;
    case 2:
        return Tip3(numar,st,dr);
        break;
    }
}
int main()
{
    int n,m,tip,numar;
    fin>>n;
    for(int i = 0;i<n;i++)
        fin>>A[i];
    fin>>m;
    for(int i = 0;i<m;i++)
    {
        fin>>tip>>numar;
        fout<<cautBin(tip,numar,0,n)<<endl;
    }
    return 0;
}