#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 6;
int a[MAX], last_modified[MAX], suf[MAX];
pair<int, int> query[MAX];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int type, x;
    cin >> type;
    if (type == 1) {
      int p;
      cin >> p >> x;
      a[p] = x;
      last_modified[p] = i;
    } else {
      cin >> x;
    }
    query[i] = {type, x};
  }
  for (int i = q; i >= 1; i--) {
    if (query[i].first == 2)
      suf[i] = max(suf[i + 1], query[i].second);
    else
      suf[i] = suf[i + 1];
  }
  for (int i = 1; i <= n; i++) {
    a[i] = max(a[i], suf[last_modified[i] + 1]);
  }
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
}
