#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> in(n);
  for (int i = 0; i < n; i++) cin >> in[i];
  int q;
  cin >> q;
  vector<int> choice(q), com(q), com2(q);
  for (int i = 0; i < q; i++) {
    cin >> choice[i];
    if (choice[i] == 1)
      cin >> com[i] >> com2[i];
    else
      cin >> com[i];
  }
  vector<int> ans(n, -1);
  int smallest = 0;
  for (int i = q - 1; i >= 0; i--) {
    if (choice[i] == 1) {
      if (ans[com[i] - 1] == -1) {
        if (smallest >= com2[i])
          ans[com[i] - 1] = smallest;
        else
          ans[com[i] - 1] = com2[i];
      }
    } else {
      smallest = smallest < com[i] ? com[i] : smallest;
    }
  }
  for (int i = 0; i < n; i++) {
    if (ans[i] == -1) {
      if (smallest >= in[i])
        ans[i] = smallest;
      else
        ans[i] = in[i];
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i] << ' ';
  return 0;
}
