#include <bits/stdc++.h>
const int maxn = 2 * 1e5 + 10;
int n, q, a[maxn], update[maxn], gov[maxn];
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    update[i] = 1;
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int t;
    cin >> t;
    if (t == 1) {
      int c, b;
      cin >> c >> b;
      a[c] = b;
      update[c] = i;
    } else {
      int x;
      cin >> x;
      gov[i] = x;
    }
  }
  for (int i = q; i >= 1; i--) {
    gov[i] = max(gov[i], gov[i + 1]);
  }
  for (int i = 1; i <= n; i++) {
    cout << max(gov[update[i]], a[i]) << " ";
  }
  return 0;
}
