#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

template<typename T>
struct BIT {
  int n;
  vector<T> d;
  BIT (int n_) : n(n_ + 1), d(n, 0) {}

  void add(int i, T x) {
    ++i;
    for (int idx = i; idx < n; idx += (idx & -idx)) {
      d[idx] += x;
    }
  }

  T sum(int i) {
    ++i;
    T s(0);
    for (int idx = i; idx > 0; idx -= (idx & -idx)) {
      s += d[idx];
    }
    return s;
  }

  T sum(int l, int r) {
    return sum(r-1) - sum(l-1);
  }

  // min_k {sum[i = 0 -> k] a_k >= w}
  int lower_bound(T w) {
    if (w <= 0) {
      return 0;
    } else {
      int x = 0, r = 1;
      while(r < n) r <<= 1;
      for (int l = r; l > 0; l >>= 1) {
        if (x + l < n && d[x + l] < w) {
          w -= d[x + l];
          x += l;
        }
      }
      return x;
    }
  }
};

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i,0,n) {
    cin >> a[i];
    --a[i];
  }
  int q;
  cin >> q;
  vector<int> prv(n+q, -1), nxt(n+q, -1);
  vector<int> t(q), k(q, -2);
  int b = n;
  rep(i,0,q) {
    cin >> t[i];
    if (t[i] == 1) {
      cin >> k[i];
      --k[i];
      if (k[i] == -1) {
        a.eb(b);
      } else if (prv[k[i]] == -1) {
        prv[k[i]] = b;
        nxt[b] = k[i];
      } else {
        int c = prv[k[i]];
        prv[k[i]] = b;
        nxt[b] = k[i];
        prv[b] = c;
        nxt[c] = b;
      }
      ++b;
    } else if (t[i] == 3) {
      cin >> k[i];
      --k[i];
    }
  }
  vector<int> x;
  rrep(i,len(a),0) {
    int v = a[i];
    do {
      x.eb(v);
      v = prv[v];
    } while (v != -1);
  }
  reverse(all(x));
  int m = len(x);
  vector<int> rx(m);
  rep(i,0,m) rx[x[i]] = i;
  BIT<int> bit(m);
  rep(i,0,n) {
    bit.add(rx[i], 1);
  }
  b = n;
  int y = 0;
  rep(i,0,q) {
    if (t[i] == 1) {
      bit.add(rx[b], 1);
      ++b;
    } else if (t[i] == 2) {
      ++y;
    } else {
      cout << x[bit.lower_bound(y+k[i]+1)]+1 << endl;
    }
  }
  return 0;
}