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

int main()
{
    int v[100001];
    int n;
    in >> n;

    for (int i = 1; i <= n; i++)
    {
        in >> v[i];
    }
    int m;
    in >> m;
    for (int j = 1; j <= m; j++)
    {
        int q, x, st = 1, dr = n, mid;
        in >> q >> x;

        while (st <= dr)
        {
            mid = (st + dr) / 2;
            if (v[mid] < x)
                st = mid + 1;
            else dr = mid - 1;
        }

        if (q == 0)
        {
            if (v[st] != x) out << -1 << endl;
            else
            {
                int index = st;
                while (v[index + 1] == v[st])
                {
                    index += 1;
                }
                out << index << endl;
            }
        }
        else if (q == 1)
        {
            if(st > n) out << n <<endl;
            else if( v[st] == x)
            {
                int ind = st + 1;
                while (v[ind] <= v[st] && ind <= n)
                {
                    ind++;
                }
                out << ind - 1 << endl;
            }
            else out << st - 1;
        }
        else if (q == 2)
        {
            out << st << endl;
        }
    }

    return 0;
}