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

int N, tip, val, pas, a[100005], M;

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

int bsearch2(int val)
{
    int i=N, lg=pas;
    for (; 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=1; pas<=N; pas<<=1);
    f>>M;
    for (int i=1; i<=M; ++i)
    {
        f>>tip>>val;
        if (tip<2) g<<bsearch01(tip, val)<<'\n';
            else g<<bsearch2(val)<<'\n';
    }
    return 0;
}