#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
unsigned long long v[100001],x;
int main()
{
    int t;
    long n,m,i,aux;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
    }
    f>>m;
    for(i=1;i<=m;i++)
    {
        f>>t>>x;
        if(t==0)
        {
            aux=upper_bound(v+1,v+n+1,x)-v-1;
            if((aux<=n)&&(aux>=1)&&(v[aux]==x))
            {
                g<<aux<<"\n";
            }
            else
            {
                g<<"-1\n";
            }
        }
        if(t==1)
        {
            aux=lower_bound(v+1,v+n+1,x+1)-v-1;
            g<<aux<<"\n";
        }
        if(t==2)
        {
            aux=upper_bound(v+1,v+n+1,x-1)-v;
            g<<aux<<"\n";
        }
    }
    return 0;
}