#include <iostream>
#include <fstream>
#include <algorithm>
#define Maxx 100001

using namespace std;

ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N,L,A[Maxx];
int M,x,y,poz,OK,st,dr,mij;
int CB0(int A[],int &N,int y)
{
    int st = 1, dr = N, mij;
    while ( st<=dr )
    {
        mij = (st+dr)/2;
        if ( y == A[mij] )
            return mij;
        else if ( y<A[mij] )
            dr = mij-1;
        else if ( y>A[mij] )
            st = mij+1;
    }
    return -1;
}
int CB1(int A[],int &N,int y)
{
    int st = 1, dr = N, mij;
    while ( st<=dr )
    {
        mij = (st+dr)/2;
        if ( y<=A[mij] )
            dr = mij-1;
        else if ( y>A[mij] )
            st = mij+1;
    }
    return dr;
}
int CB2(int A[],int &N,int y)
{
    int st = 1, dr = N, mij;
    while ( st<=dr )
    {
        mij = (st+dr)/2;
         if ( y<=A[mij] )
            dr = mij-1;
        else if ( y>A[mij] )
            st = mij+1;
    }
    return st;
}
int pas1(int y)
{
    int poz = CB0(A,N,y);
    if ( A[poz]==A[poz+1] )
        poz++;
    g << poz << endl;
}
int pas2(int y)
{
    int poz = CB1(A,N,y);
    g << poz << endl;
}
int pas3(int y)
{
    int poz = CB2(A,N,y);
    while ( A[poz]==A[poz-1] )
        poz--;
    g << poz << endl;
}

int main()
{
    f >> N;
    for(int i=1; i<=N; i++)
        f >> A[i];
    f >> M;
    for(int i=1; i<=M; i++)
    {
        f >> x >> y;
        if ( x==0 )
            pas1(y);
        else if ( x==1 )
            pas2(y);
        else pas3(y);

    }
    return 0;
}