#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;

int v[100002],n,x,i,j,st,dr,t;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
using namespace std;
int m;
int main()
{
    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];

    for(fin>>m;m--;) {
        fin>>t>>x;
        if (t == 0) {
            // ultima poitie cu x sau -1
            // <=x inseamna 0 si >x inseamna 1
            st = 1; dr = n;
            while (st <= dr) {
                int  mid = (st+dr)/2;
                if (v[mid] <= x)
                    st = mid+1;
                else
                    dr = mid-1;
            }
            if (v[dr] == x)
                fout<<dr<<"\n";
            else
                fout<<"-1\n";
        }
        if (t == 1) {
            st = 1; dr = n;
            while (st <= dr) {
                int  mid = (st+dr)/2;
                if (v[mid] <= x)
                    st = mid+1;
                else
                    dr = mid-1;
            }
            fout<<dr<<"\n";
        }
        if (t == 2) {
            st = 1; dr = n;
            while (st <= dr) {
                int  mid = (st+dr)/2;
                if (v[mid] < x)
                    st = mid+1;
                else
                    dr = mid-1;
            }
            fout<<st<<"\n";
        }
    }


    return 0;
}