#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,v[100001],y,x;
int cautare_binara()
{
    int lo=0,hi=n+1,mij;
    while(hi-lo>1)
    {
        mij=(lo+hi)/2;
        if(v[mij]<x)
            lo=mij;
        else
            hi=mij;
    }
    if(hi<n+1&&v[hi]==x)
        return hi;
    else
        return -1;
}
int cautare_binara2()
{
    int lo=0,hi=n+1,mij,t=0;
    while(t==0)
    {
        x=x-1;
        while(hi-lo>1)
        {
            mij=(lo+hi)/2;
            if(v[mij]<x)
                lo=mij;
            else
                hi=mij;
        }
        if(hi<n+1&&v[hi]==x)
        {
            return hi;
            t=1;
        }
    }
}
int cautare_binara3()
{
    int lo=0,hi=n+1,mij,p=0;
    while(p==0)
    {
        x=x+1;
        while(hi-lo>1)
        {
            mij=(lo+hi)/2;
            if(v[mij]<x)
                lo=mij;
            else
                hi=mij;
        }
        if(hi<n+1&&v[hi]==x)
        {
            return hi;
            p=1;
        }
    }
}
int main()
{
    int i;
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i];
    f>>m;
    while(m>0)
    {
        f>>y;
        switch(y)
        {
            case 0:
            {
                int k;
                f>>x;
                k=cautare_binara();
                if(k==-1)
                    g<<-1<<'\n';
                else
                {
                    while(v[k]==v[k+1])
                    {
                        k=k+1;
                    }
                    g<<k<<'\n';
                }
                break;
            }
            case 1:
            {
                int k;
                f>>x;
                k=cautare_binara();
                if(k==-1)
                {
                    k=cautare_binara2();
                    while(v[k]==v[k+1])
                    {
                        k=k+1;
                    }
                    g<<k<<'\n';
                }
                else
                {
                    while(v[k]==v[k+1])
                    {
                        k=k+1;
                    }
                    g<<k<<'\n';
                }
                break;
            }
            case 2:
            {
                int k;
                f>>x;
                k=cautare_binara();
                if(k==-1)
                {
                    k=cautare_binara3();
                    while(v[k]==v[k-1])
                    {
                        k=k-1;
                    }
                    g<<k<<'\n';
                }
                else
                {
                    while(v[k]==v[k-1])
                    {
                        k=k-1;
                    }
                    g<<k<<'\n';
                }
                break;
            }
        }
        m--;
        if(m==0)
            break;
    }

    return 0;
}