#include<fstream>
#include<algorithm>

using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int n,M,a[100001],i,x,intr,poz;

int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>a[i];

    fin>>M;

    for(i=1;i<=M;i++)
    {
        fin>>intr>>x;
        if(intr==0)
        {
            poz=upper_bound(a+1,a+n+1,x)-a-1;
            if(poz>=1 and poz<=n and a[poz]==x)
                fout<<poz<<endl;
            else
                fout<<-1<<endl;
        }
        else
        if(intr==1)
        {
            poz=upper_bound(a+1,a+n+1,x)-a-1;
            fout<<poz<<endl;
        }
        else
        {
            poz=upper_bound(a+1,a+n+1,x-1)-a;
            fout<<poz<<endl;
        }
    }
    return 0;
}