#include <bits/stdc++.h>
using namespace std;
const int MX = 1000005;
const long long mod = 998244353;
const long long inf = 1e18;
long long a[MX], T[4 * MX], last[MX];
void up(int p, int l, int h, int x, int vl) {
  if (l == h) {
    T[p] = vl;
    return;
  }
  int m = (l + h) / 2;
  if (x <= m)
    up(2 * p, l, m, x, vl);
  else
    up(2 * p + 1, m + 1, h, x, vl);
  T[p] = max(T[2 * p], T[2 * p + 1]);
}
long long Q(int p, int l, int h, int x, int y) {
  if (l > y || h < x) return 0;
  if (l >= x && h <= y) return T[p];
  int m = (l + h) / 2;
  return max(Q(2 * p, l, m, x, y), Q(2 * p + 1, m + 1, h, x, y));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, q;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int p, x, op;
    cin >> op;
    if (op == 1) {
      cin >> p >> x;
      a[p] = x;
      last[p] = i;
    } else {
      cin >> x;
      up(1, 1, q, i, x);
    }
  }
  for (int i = 1; i <= n; i++) {
    long long vl = Q(1, 1, q, last[i] + 1, q);
    if (vl > a[i]) a[i] = vl;
  }
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
