#include <bits/stdc++.h>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n, a[100009];
void read()
{
   in >> n;
   for(int i=0; i<n; i++)
      in >> a[i];
}

int main()
{
    read();
    int m, c, x, k; in >> m;
    while(m--)
    {
        in >> c >> x;
            if ( !c )
            {
                k = upper_bound(a,a+n,x)-a;
                if( k && a[k-1] == x ) out << k << '\n'; else out << -1;
            }
            if( c==1)
                out << upper_bound(a, a+n,x)-a << '\n';
            if( c==2 )
                out << lower_bound(a,a+n,x)-a +1 << '\n';
    }

    return 0;
}