#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
using namespace std;
ofstream out("cautbin.out");
const int maxn = 100005;
const int max_size = 100005;
char txt[max_size];
int v[maxn];
char T[25];
int logn;
int n;
inline int cautbin_0(int x)
{
    int i, pas;
    for (pas = 1; pas < n; pas <<= 1);
    for (i = 0; pas; pas >>= 1)
        if (i + pas <= n && v[i + pas] <= x)
           i += pas;
    return i;
}

inline int cautbin_2(int x)
{
    int st = 1;
    int dr = n;
    int ret = -1;
    while(st <= dr)
    {
        int mij = st + (dr - st) / 2;
        if(x <= v[mij])
        {
            ret = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return ret;
}

int poz = max_size - 1;
FILE *fin;
inline void parsare(int &nr)
{
    nr = 0;
    while(!isdigit(txt[poz]))
    {
        if(++poz == max_size)
        {
            fread(txt, 1, max_size, fin);
            poz = 0;
        }
    }
    while(isdigit(txt[poz]))
    {
        nr = nr * 10 + txt[poz] - '0';
        if (++poz == max_size)
        {
            fread(txt, 1, max_size, fin);
            poz = 0;
        }
    }
}
string afis;
inline void add(int nr)
{
    string p;
    while(nr > 0)
    {
        p = p + (char)(nr % 10 + '0');
        nr = nr / 10;
    }
    reverse(p.begin(), p.end());
    afis += p;
}
int main()
{
    fin = fopen("cautbin.in", "r");
    freopen("cautbin.out", "w", stdout);
    parsare(n);
    for(int i = 1; i <= n; i++)
        parsare(v[i]);
    int m;
    parsare(m);
    for(int i = 1; i <= m; i++)
    {
        int x = 0;
        int y = 0;
        parsare(x);
        parsare(y);
        if(x == 0 || x == 1)
        {
            int sol = cautbin_0(y);
            if(x == 0 && v[sol] != y)
                afis += "-1";
            else
                add(sol);
        }
        else
            add(cautbin_2(y));
        afis += "\n";
        if((int)afis.size() > maxn / 10)
        {
            out << afis;
            afis = "";
        }
    }
    out << afis;
    return 0;
}