#include <bits/stdc++.h>
using namespace std;
int n,i,t,x,st,dr,mij,v[100005],T;
int main(void){
    ifstream fin("cautbin.in");
    ofstream fout("cautbin.out");
    fin >> n;
    for(i=1;i<=n;i++)
    {
        fin >> v[i];
    }
    fin >> T;
    for(i=1;i<=T;i++)
    {
        fin >> t >> x;
        st = 1;
        dr = n;
        if(t == 0)
        {
            while(st <= dr)
            {
                mij = (st+dr)/2;
                if(v[mij] == x)
                {
                    st = mij+1;
                } else if(v[mij] < x)
                {
                    st = mij+1;
                } else if(v[mij] > x)
                {
                    dr = mij-1;
                }
            }
            if(v[dr] == x)
            {
                fout << dr << "\n";
            } else {
                fout << -1 << "\n";
            }
        }
        if(t==1)
        {
            while(st <= dr)
            {
                mij = (st+dr)/2;
                if(v[mij] == x)
                {
                    st = mij+1;
                } else if(v[mij] < x)
                {
                    st = mij+1;
                } else if(v[mij] > x)
                {
                    dr = mij-1;
                }
            }
            fout << dr << "\n";
        }
        if(t==2)
        {
            while(st <= dr)
            {
                mij = (st+dr)/2;
                if(v[mij] == x)
                {
                    dr = mij-1;
                } else if(v[mij] < x)
                {
                    st = mij+1;
                } else if(v[mij] > x)
                {
                    dr = mij-1;
                }
            }
            fout << st << "\n";
        }
    }
}