#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int v[100004];

bool verif(int acc,int currentpower,int k,int n)
{

    return (acc + currentpower < n) && (v[acc+currentpower]<=k);
}

int cautbin(int problem,int currentpower, int searchedelem,int n)
{
    int acc=0;
    while(currentpower>0)
    {

        if(verif(acc,currentpower,searchedelem,n))
            acc+=currentpower;
        currentpower>>=1;
    }

    return acc;


}

int main()
{
    int n,m;
    int problem,val;
    fin>>n;
    int currentpower=0X1;

    while(currentpower<n)
    {
        currentpower<<=1;
    }
    currentpower>>=1;

    for(int i=0;i<n;i++)
        fin>>v[i];

    fin>>m;

    for(int i=0;i<m;i++)
        {
            fin>>problem>>val;
            if(problem==0)
            {
                int index=cautbin(problem,currentpower,val+1,n);
                if(v[index]==val)
                    fout<<index+1<<'\n';
                else
                    fout<<"-1"<<'\n';


            }

            if(problem==1)
            {
                fout<<cautbin(problem,currentpower,val+1,n)+1<<'\n';


            }

            if(problem==2)
            {
                fout<<cautbin(problem,currentpower,val,n)+2<<'\n';


            }
        }
    return 0;
}