#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream in("cautbin.in");
ofstream out("cautbin.out");

int v[100001],n,m,a[5];
long long const N=1<<10;
long long pas;

void caut0(int x,int r)
{
    pas=N;
    while(pas!=0)
    {
        if(r+pas<=n && v[pas+r]<=x)
            r+=pas;
        pas/=2;
    }
    if(v[r]!=x)
        r=-1;
    out<<r<<"\n";
}

void caut1(int x,int r)
{
    pas=N;
    while(pas!=0)
    {
        if(r+pas<=n && v[pas+r]<=x)
            r+=pas;
        pas/=2;
    }
    out<<r<<"\n";
}

void caut2(int x,int r)
{
     pas=1;
    while(pas<=N)
    {
        if(r+pas<=n && v[pas+r]>=x)
            r+=pas;
        pas*=2;
    }
    out<<r<<"\n";
}

int main()
{
    int i,r=0,nr,x;
    in>>n;
    for(i=1; i<=n; i++)
        in>>v[i];
    in>>m;
    sort(v+1,v+n+1);
    in>>nr>>x;
    while(!in.eof())
    {
        if(nr==0)
        {
            caut0(x,0);
        }
        if(nr==1)
        {
            caut1(x,0);
        }
        if(nr==2)
        {
            caut2(x,0);
        }
        in>>nr>>x;
    }
    return 0;
}