#include <fstream>
#include <iostream>
using namespace std;

ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int n, v[100001];

int maxBinarySearch(int el) {
    int left = 1, right = n;
    while (left < right) {
        int middle = left + (right - left) / 2 + (right - left) % 2;
        if (v[middle] <= el)
            left = middle;
        else
            right = middle - 1;
    }
    return left;
}

int minBinarySearch(int el) {
    int left = 1, right = n;
    while (left < right) {
        int middle = left + (right - left) / 2;
        if (v[middle] < el)
            left = middle + 1;
        else
            right = middle;
    }
    return left;
}

int main() {
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    int m, type, el;
    fin >> m;
    while (m--) {
        fin >> type >> el;

        if (type < 2) {
            int pos = maxBinarySearch(el);
            if (!type && v[pos] != el)
                fout << "-1\n";
            else
                fout << pos << "\n";
        }
        else
            fout << minBinarySearch(el) << "\n";
    }
    return 0;
}
/*
-> cea mai mare pozitie
int middle = left + (right - left) / 2 + (right - left) % 2;
if (v[middle] <= el)
    left = middle;
else
    right = middle - 1;


-> cea mai mica pozitie
int middle = left + (right - left) / 2;
if (v[middle] < el)
    left = middle + 1;
else
    right = middle;
*/