#include <iostream>
#include <fstream>
#define dm 100005
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n;
int A[dm];
int cautare1(int x)
{
    int st=1, dr=n, mid;
    while(st<dr)
    {
        mid=(st+dr+1)/2;
        if(A[mid]>x)
            dr=mid-1;
        else
            st=mid;
    }
        if(A[dr]!=x)
            return -1;
        return dr;
}
int cautare2(int x)
{
    int dr=n, st=1, mid;
    while(st<dr)
    {
        mid=(st+dr+1)/2;
        if(A[mid]>x)
            dr=mid-1;
        else
            st=mid;
    }
    return dr;
}
int cautare3(int x)
{
    int dr=n, st=1, mid;
    while(st<dr)
    {
        mid=(st+dr)/2;
        if(A[mid]<x)st=mid+1;
        else dr=mid;
    }
    return st;
}
int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>A[i];
    int k;
    fin>>k;
    for(int i=1; i<=k; i++)
    {
        int x, p;
        fin>>x>>p;
        if(x==0)
            fout<<cautare1(p)<<"\n";
        else if(x==1)
            fout<<cautare2(p)<<"\n";
        else
            fout<<cautare3(p)<<"\n";
    }
}