#include <iostream>
#include <fstream>

using namespace std;

const int N = 100001;
const int L = 16;

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

int v[N], n;

int caut0 (int x)
{
    int r=0;
    int pas=1<<L;
    while (pas!=0)
    {
        if (r+pas<=n && v[r+pas]<=x)
            r+=pas;
        pas/=2;
    }
    if (v[r]!=x)
        return -1;
    return r;
}

int caut1 (int x)
{
    int r=0, pas=1<<L;
    while (pas!=0)
    {
        if (r+pas<=n && v[r+pas]<=x)
            r+=pas;
        pas/=2;
    }
    return r;
}

int caut2 (int x)
{
    int r=0, pas=1<<L;
    while (pas!=0)
    {
        if (r+pas<=n && v[r+pas]<x)
            r+=pas;
        pas/=2;
    }
    r++;
    return r;
}

int main()
{
    int m, tip, val;
    in >> n;
    for (int i=1; i<=n; i++)
        in>>v[i];
    in>> m;
    for (int i = 0; i < m; i++)
    {
        in >> tip >> val;
        if (tip == 0)
        {
            out << caut0(val);
        }
        if (tip == 1)
        {
            out << caut1(val);
        }
        if (tip == 2)
        {
            out << caut2(val);
        }
        out << "\n";
    }
    in.close();
    out.close();
    return 0;
}