//四則演算 #pragma GCC target("avx")
//並列計算 #pragma GCC optimize("O3")
//条件分岐を減らす #pragma GCC optimize("unroll-loops")
//浮動小数点演算 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(i) sort(i.begin(),i.end())
#define rSORT(i) sort(i.rbegin(),i.rend())
#define fSORT(i,a) sort(i.begin(),i.end(),a)
#define all(i) i.begin(),i.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

int main() {
    init();

    int n; cin >> n;
    int sq = sqrt(n);
    VI a(n), c(n); cin >> a >> c;
    VI b((n + sq - 1) / sq), d((n + sq - 1) / sq), e((n + sq - 1) / sq);
    //e 0:どちらもコピーされていない 1:Aがコピー元 2:Bがコピー元

    {
        int s = INF, t = INF;
        FOR(i, 0, n) {
            chmin(s, a[i]), chmin(t, c[i]);
            if (i == n - 1 || (i + 1) % sq == 0) {
                b[i / sq] = s, d[i / sq] = t;
                s = t = INF;
            }
        }
    }

    //type 1:Aをコピーする 2:Bをコピーする
    function<void(int, int)> Trans = [&](int type, int num)->void {
        VI *w = &a, *x = &b, *y = &c, *z = &d;
        if (type == 1)swap(w, y), swap(x, z);
        x->at(num) = z->at(num);
        for (int i = sq * num, m = min(n, sq * (num + 1)); i < m; ++i) {
            w->at(i) = y->at(i);
        }
    };
    function<void(int, int, int, int)> Assign = [&](int type, int idx, int num, int val)->void {
        VI *w = (type == 1 ? &a : &c), *x = (type == 1 ? &b : &d);
        w->at(idx) = val;
        int res = INF;
        for (int i = num * sq, m = min((num + 1) * sq, n); i < m; ++i) {
            chmin(res, w->at(i));
        }
        x->at(num) = res;
    };

    int q; cin >> q;
    while (q--) {
        int x, y, z; cin >> x >> y >> z;
        if (x <= 2) {
            --y;
            int num = y / sq;
            if (e[num] != 0) {
                Trans(e[num], num);
                e[num] = 0;
            }
            Assign(x, y, num, z);
        }
        else if (5 <= x) {
            each(i, e)if (i == 0)i = 7 - x;
        }
        else {
            --y;
            int res = INF;
            for (int i = y; i < z;) {
                int num = i / sq, k;
                if (x == 3) {
                    if (e[num] == 2)k = 2;
                    else k = 1;
                }
                else {
                    if (e[num] == 1)k = 1;
                    else k = 2;
                }

                if (i % sq || z < min(i + sq, n)) {
                    chmin(res, (k == 1 ? a[i] : c[i]));
                    ++i;
                }
                else {
                    chmin(res, (k == 1 ? b[num] : d[num]));
                    i += sq;
                }
            }
            print(res);
        }
    }

    return 0;
}



Measured memory_bytes: 4272