#include <bits/stdc++.h>

using namespace std;

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

int n,m,V[100005];

int main()
{
    fin>>n;
    for(int i = 1;i<=n;i++)
        fin>>V[i];
    fin>>m;
    for(int i = 1;i<=m;i++)
    {
        int p,val;
        fin>>p>>val;
        int st = 1;
        int dr = n;
        if(p == 0)
        {
            int sol = -1;
            while(st<=dr)
            {
                int mij = (st+dr)/2;
                if(val==V[mij])
                {
                    sol = mij;
                    st = mij+1;
                }
                else{
                    if(val<V[mij])
                        dr = mij-1;
                    else{
                        st = mij+1;
                    }
                }

            }
            fout<<sol<<'\n';
        }
        if(p == 1)
        {
            int sol = -1;
            while(st<=dr)
            {
                int mij = (st+dr)/2;
                if(val==V[mij])
                {
                    st = mij+1;
                    sol = mij;
                }
                else{
                    if(val<V[mij])
                        dr = mij-1;
                    else{
                        if(sol<mij)
                         {
                             st = mij+1;
                             sol = mij;
                         }
                    }
                }

            }
            fout<<sol<<'\n';
        }
        if(p==2)
        {
            int sol = n+1;
            while(st<=dr)
            {
                int mij = (st+dr)/2;
                if(val<=V[mij])
                {
                    dr = mij-1;
                    if(sol>mij)
                        sol = mij;
                }
                else{
                    st = mij+1;
                }
            }
            fout<<sol<<'\n';
        }
    }
}