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

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

int n, m, v[100001];

int cautare_binara1(int x)
{
    int st = 0, dr = n - 1;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (v[mid] == x && v[mid + 1] != x)
            return mid + 1;
        if (v[mid] > x)
            dr = mid - 1;
        else
            st = mid + 1;
    }
    return -1;
}

int cautare_binara2(int x)
{
    int st = 0, dr = n - 1;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (v[mid] == x && v[mid + 1] != x)
            return mid + 1;
        if (v[mid] > x)
            dr = mid - 1;
        else
            st = mid + 1;
    }
    return dr + 1;
}

int cautare_binara3(int x)
{
    int st = 0, dr = n - 1;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (v[mid] == x && mid == 0)
            return 1;
        if (v[mid] == x && v[mid - 1] != x)
            return mid + 1;
        if (v[mid] < x)
            st = mid + 1;
        else
            dr = mid - 1;
    }
    return st + 1;
}
void citire()
{
    fin >> n;
    for (int i = 0; i < n; ++i)
        fin >> v[i];
    fin >> m;
}

void rezolvare()
{

    for (int i = 0; i < m; ++i)
    {
        int t, val;
        fin >> t >> val;
        if (t == 0)
            fout << cautare_binara1(val) << "\n";
        else if (t == 1)
            fout << cautare_binara2(val) << "\n";
        else if (t == 2)
            fout << cautare_binara3(val) << "\n";
    }
}


int main()
{
    citire();
    rezolvare();
    return 0;
}