#include <bits/stdc++.h>
using namespace std;
const long long INF = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 2;
int n, a[N], suff[N], timer[N], q;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  scanf("%d", &q);
  for (int i = 1; i <= q; ++i) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      int p, x;
      scanf("%d %d", &p, &x);
      timer[p] = i;
      a[p] = x;
    } else {
      int x;
      scanf("%d", &x);
      suff[i] = x;
    }
  }
  for (int i = q; i >= 0; --i) suff[i] = max(suff[i + 1], suff[i]);
  for (int i = 1; i <= n; ++i)
    a[i] = max(a[i], suff[timer[i]]), printf("%d ", a[i]);
  return 0;
}
