#include <fstream>

using namespace std;

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

const int NMAX = 100005;

int arr[NMAX], N, M, value, query;

int Search (int query, int value) {
    int left = 1, mid, right = N, pos = -1;

    while (left <= right) {
        mid = left + (right - left)/2;
        if (arr[mid] == value) {
            pos = mid;
            if (query == 2)
                right = mid - 1;
            else left = mid + 1;
        }
        else if (value > arr[mid]) {
             if (query == 1)
                pos = mid;
             left = mid + 1;
        }
        else {
            if (query == 2)
                pos = mid;
            right = mid -1;
        }
    }

    return pos;
}

int main()
{
    in >> N;
    for (int i = 1; i <= N; ++ i){
        in  >> arr[i];
    }

    in >> M;
    for (int i = 1; i <= M; ++ i) {
        in >> query >> value;
        out << Search (query, value) << '\n';
    }

    return 0;
}