#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    int n,i,v[999],m,x,ok,p,q,mij,c,mij2,y,t;
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i];
    f>>m;
    while(m>0)
    {
        f>>y;
        f>>x;
        p=1;
        q=n;
        ok=0;
        while(p<=q&&ok==0&&m>0&&y==0)
        {
            mij=(p+q)/2;
            if(v[mij]==x)
            {
                ok=1;
            }
            else
            if(x<v[mij])
            {
                q=mij-1;
            }
            else
                p=mij+1;
            while(v[mij]==v[mij+1])
            {
                mij=mij+1;
            }
        }
        if(ok==0&&m>0&&y==0)
            g<<"-1"<<endl;
        if(ok==1&&m>0&&y==0)
            g<<mij<<endl;
        p=1;
        q=n;
        ok=0;
        c=0;
        mij2=mij;
        while(ok==0&&m>0&&y==1)
        {
            if(v[mij]==v[mij+1])
            {
                mij=mij+1;
                c=c+1;
            }
            else
                ok=1;
        }
        if(c==0&&m>0&&y==1)
            g<<mij2<<endl;
        if(c!=0&&m>0&&y==1)
            g<<mij<<endl;
        p=1;
        q=n;
        ok=0;
        c=0;
        mij=mij2;
        while(ok==0&&m>0&&y==2)
        {
            if(v[mij]==v[mij-1])
            {
                mij=mij-1;
                c=c+1;
            }
            else
                ok=1;
        }
        if(c==0&&m>0&&y==2)
            g<<mij2<<endl;
        if(c!=0&&m>0&&y==2)
            g<<mij<<endl;
        m=m-1;
    }
    return 0;
}