#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
int p[N], id[N], b[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int op, pp, x;
    cin >> op;
    if (op == 1) {
      cin >> pp >> x;
      id[pp] = i;
      p[pp] = x;
    } else
      cin >> b[i];
  }
  for (int i = q; ~i; i--) {
    b[i] = max(b[i], b[i + 1]);
  }
  for (int i = 1; i <= n; i++) {
    cout << max(p[i], b[id[i]]) << ' ';
  }
  return 0;
}
