#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint;

int op(int a, int b) { return a + b; }

int e() { return 0; }

int target;

bool f(int x) { return x < target; }

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        A[i]--;
    }
    int Q;
    cin >> Q;
    vector<int> t(Q);
    vector<int> a(Q);
    vector<int> k(Q);
    for (int i = 0; i < Q; i++) {
        cin >> t[i];
        if (t[i] == 1) {
            cin >> a[i];
            a[i]--;
        } else if (t[i] == 3) {
            cin >> k[i];
        }
    }
    // step 1. とりあえず双方向リストで B に現れる数を順に並べる
    vector<int> prev(N + Q, -1);
    vector<int> next(N + Q, -1);
    for (int i = 0; i < N - 1; i++) {
        prev[A[i + 1]] = A[i];
        next[A[i]] = A[i + 1];
    }
    int now_top = A[0];
    int now_back = A[N - 1];
    int nnum = N;
    for (int i = 0; i < Q; i++) {
        if (t[i] == 1) {
            if (a[i] == -1) {
                next[now_back] = nnum;
                prev[nnum] = now_back;
                now_back = nnum;
            } else if (a[i] == now_top) {
                prev[now_top] = nnum;
                next[nnum] = now_top;
                now_top = nnum;
            } else {
                int prev_val = prev[a[i]];
                prev[a[i]] = nnum;
                prev[nnum] = prev_val;
                next[prev_val] = nnum;
                next[nnum] = a[i];
            }
            nnum++;
        }
    }
    vector<int> arrs(0);
    int now = now_top;
    while (true) {
        arrs.push_back(now);
        now = next[now];
        if (now == -1) {
            break;
        }
    }

    // Step 2. セグ木二分探索で適宜切る位置を求める
    // 「消された」か「消されてない」かを管理しておく
    int len = arrs.size();
    segtree<int, op, e> seg(len);
    for (int i = 0; i < len; i++) {
        if (arrs[len] < N) {
            seg.set(i, 1);
        }
    }
    vector<int> invs(len);
    for (int i = 0; i < len; i++) {
        invs[arrs[i]] = i;
    }
    // debug(invs);
    nnum = N;
    for (int i = 0; i < Q; i++) {
        if (t[i] == 1) {
            seg.set(invs[nnum], 1);
            nnum++;
        } else if (t[i] == 2) {
            target = 1;
            int mr = seg.max_right<f>(0);
            // debug(mr);
            seg.set(mr, 0);
        } else {
            target = k[i];
            int mr = seg.max_right<f>(0);
            cout << arrs[mr] + 1 << endl;
        }
    }
}