#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");

const int Nmax = 100555;
int N, M, a[Nmax], q, x;

// cea mai mare pozitie pe care se afla un element cu valoarea x
int op0(int lo, int hi, int x) { // closed interval [lo, hi]
  while(lo < hi) { // a[el] <= x
    int mid = lo + (hi - lo + 1) / 2;
    if (a[mid] <= x) {
      lo = mid;
    } else {
      hi = mid -1;
    }
  }
  if (a[lo] == x) {
    return lo;
  } else {
    return -1;
  }
}
int op1(int lo, int hi, int val) { // closed interval [lo, hi]
  while(lo < hi) {
    int mid = lo + (hi - lo + 1) / 2;
    if (a[mid] <= x) {
      lo = mid;
    } else {
      hi = mid - 1;
    }
  }
  return lo;
}
int op2(int lo, int hi, int val) { // closed interval [lo, hi]
  while(lo < hi) {
    int mid = lo + (hi - lo) / 2;
    if (a[mid] >= x) {
      hi = mid;
    } else {
      lo = mid + 1;
    }
  }
  return lo;
}

int main(void) {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  fin >> N;
  rep(i, N) { fin >> a[i+1]; }
  fin >> M;
  rep(i, M) {
    fin >> q >> x;
    switch(q) {
      case 0:
        fout << op0(1, N, x);
        break;
      case 1:
        fout << op1(1, N, x);
        break;
      case 2:
        fout << op2(1, N, x);
        break;
    }
    fout << '\n';
  }
  return 0;
}