#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x); re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

template <class T> 
void wr(T x) {
    cout << x;
}

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}


inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

void solve() {
    int n; re(n);
    vt <int> a(n); re(a);

    int q; re(q);
    while (q--) {
        int task, x; re(task, x);
        if(task == 0) {
            /* from cppreference:
               Returns an iterator pointing to the first element
               in the range [first, last) such that value < element (or comp(value, element)) 
               is true (i.e. strictly greater), or last if no such element is found.
            */
            int pos = upper_bound(all(a), x) - a.begin();
            --pos;
            if (pos >= 0 and a[pos] == x) {
                wr(pos + 1, '\n');
            } else {
               wr("-1\n");
            }

            continue;
        }

        if(task == 1) {
            /* from cppreference:
               Returns an iterator pointing to the first element
               in the range [first, last) that does not satisfy element < value (or comp(element, value))
               (i.e. greater or equal to), or last if no such element is found.
            */
            int pos = lower_bound(all(a), x + 1) - a.begin();
            --pos;
            if (pos >= 0 and a[pos] <= x) {
                wr(pos + 1, '\n');
            }

            continue;
        }

        int pos = lower_bound(all(a), x) - a.begin();
        if (pos >= 0 and a[pos] >= x) {
            wr(pos + 1, '\n');
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("cautbin");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}