#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");

int N, a[100005], M, tip, x, pas=1;

int bsearch01(int val, int tip)
{
    int lg, i;
    for (lg=pas, i=0; lg; lg>>=1)
        if (i+lg<=N && a[i+lg]<=val) i+=lg;

    if (!tip && a[i]!=val) return -1;
        else return i;
}

int bsearch2(int val)
{
    int lg, i;
    for (lg=pas, i=N; lg; lg>>=1)
        if (i-lg>0 && a[i-lg]>=val) i-=lg;
    return i;
}

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i)
        f>>a[i];
    for (; pas<=N; pas<<=1);

    f>>M;
    for (int i=1; i<=M; ++i)
    {
        f>>tip>>x;
        if (tip<2) g<<bsearch01(x, tip)<<'\n';
            else g<<bsearch2(x)<<'\n';
    }
    return 0;
}