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

const int maxn = 100005;
int v[maxn];
int logn;
int n;
inline int cautbin_0(int x)
{
    int i, pas;
    for (pas = 1; pas < n; pas <<= 1);
    for (i = 0; pas; pas >>= 1)
        if (i + pas < n && v[i + pas] <= x)
           i += pas;
    if(v[i] == x)
        return i;
    return -1;
}

inline int cautbin_1(int x)
{
    int st = 1;
    int dr = n;
    int ret = -1;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(x <= v[mij])
        {
            ret = mij;
            st = mij + 1;
        }
        else
            dr = mij - 1;
    }
    return ret;
}

inline int cautbin_2(int x)
{
    int st = 1;
    int dr = n;
    int ret = -1;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(x >= v[mij])
        {
            ret = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return ret;
}

int main()
{
    in >> n;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    int m;
    in >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        if(x == 0)
            out << cautbin_0(y);
        else if(x == 1)
            out << cautbin_1(y) - 1;
        else
            out << cautbin_2(y) + 1;
        out << "\n";
    }
    return 0;
}