#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


using S = int;
S op(S l, S r) { return l+r; }
S e() { return 0; }
int B = 0;
bool f(S x) { return x < B; }
struct T{
    deque<int> bs;
    int val;
    T(int x=-1): val(x) {}
};

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;
    int q;
    cin >> q;
    vector<pair<int, int>> qs;
    rep(i, q) {
        int t;
        cin >> t;
        if(t == 2) qs.emplace_back(t, -1);
        else {
            int x;
            cin >> x;
            qs.emplace_back(t, x);
        }
    }

    vector<vector<int>> g(n+q+1);
    int b_front = n+1;
    g[0] = a;
    for(auto[t, x]: qs) if(t == 1) g[x].push_back(b_front++);

    vector<int> v;
    auto dfs = [&](auto dfs, int pos) -> void {
        for(int to: g[pos]) {
            dfs(dfs, to);
        }
        v.push_back(pos);
    };
    dfs(dfs, 0);
    int s = v.size();
    vector<int> inv(n+q+1);
    rep(i, s) inv[v[i]] = i;

    segtree<S, op, e> st(s);
    rep(i, s) if(v[i] <= n) st.set(i, 1);
    int p = 0;
    b_front = n+1;
    for(auto[t, x]: qs) {
        if(t == 1) {
            st.set(inv[b_front++], 1);
        }
        if(t == 2) {
            while(st.get(p) == 0) p++;
            st.set(p, 0);
            p++;
        }
        if(t == 3) {
            B = x;
            int r = st.max_right<f>(p);
            cout << v[r] << '\n'; 
        }
    }
    return 0;
}