#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, q, cnt;
int op[N], last[N];
int a[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    if (x == 1) {
      int k, v;
      cin >> k >> v;
      a[k] = v;
      last[k] = cnt + 1;
    } else {
      int v;
      cin >> v;
      op[++cnt] = v;
    }
  }
  for (int i = cnt - 1; i >= 0; i--) op[i] = max(op[i], op[i + 1]);
  for (int i = 1; i <= n; i++) a[i] = max(a[i], op[last[i]]);
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  return 0;
}
