#include<iostream>
#include<algorithm>

using namespace std;

const int N = 100010;
int a[N];
int tm[4 * N], tx[4 * N];

void change(int v, int L, int R, int l, int r, int x) {
    if (L == l && R == r) {
        tx[v] = x;
        tm[v] = x;
    }
    else {
        int M = (L + R) / 2;
        if (tx[v] != -1) {
            tx[v * 2 + 1] = tx[v];
            tx[v * 2 + 2] = tx[v];
        }
        tx[v] = -1;

        if (l <= M) {
            change(v * 2 + 1, L, M, l, min(M, r), x);
        }
        if (r > M) {
            change(v * 2 + 2, M + 1, R, max(M + 1, l), r, x);
        }

        tm[v] = min(tm[v * 2 + 1], tm[v * 2 + 2]);
    }
}

void get(int v, int L, int R, int l, int r) {
    if (L == l && R == r) {
        cout << tm[v] << ' ';
        return;
    }
    if (tx[v] != -1){
        cout << tx[v] << ' ';
        return;
    }

    int M = (L + R) / 2;
    if (l <= M) {
        get(v * 2 + 1, L, M, l, min(M, r));
    }
    if (r > M) {
        get(v * 2 + 2, M + 1, R, max(M + 1, l), r);
    }
}

void build(int v, int L, int R) {
    if (L == R) {
        tx[v] = a[L];
        tm[v] = a[L];
    }
    else {
        int M = (L + R) / 2;
        build(v * 2 + 1, L, M);
        build(v * 2 + 2, M + 1, R);
        tm[v] = min(tm[v * 2 + 1], tm[v * 2 + 2]);
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    build(0, 0, n - 1);

    cin >> m;
    for (int i = 0; i < m; i++) {
        int op, l, r, val;
        cin >> op;
        if (op == 1) {
            cin >> l >> r;
            get(0, 0, n - 1, l - 1, r - 1);
        }
        else {
            cin >> l >> r >> val;
            change(0, 0, n - 1, l - 1, r - 1, val);
        }
    }

    system("pause");
    return 0;
}