#include <bits/stdc++.h>
using namespace std;
int n;
int a[200000 + 10];
int Q;
int num1, num2;
int b[200000 + 10], c[200000 + 10];
int MAX[200000 + 10 << 2];
void PushUp(int rt) { MAX[rt] = max(MAX[rt << 1], MAX[rt << 1 | 1]); }
void build(int l, int r, int rt) {
  if (l == r) {
    MAX[rt] = c[l];
    return;
  }
  int m = (l + r) >> 1;
  build(l, m, rt << 1);
  build(m + 1, r, rt << 1 | 1);
  PushUp(rt);
}
int query(int L, int R, int l, int r, int rt) {
  if (L <= l && r <= R) return MAX[rt];
  int ret = 0;
  int m = (l + r) >> 1;
  if (L <= m) ret = max(ret, query(L, R, l, m, rt << 1));
  if (R > m) ret = max(ret, query(L, R, m + 1, r, rt << 1 | 1));
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  scanf("%d", &Q);
  for (int q = 1; q <= Q; q++) {
    int op, p, x;
    scanf("%d", &op);
    if (op == 1) {
      scanf("%d%d", &p, &x);
      a[p] = x;
      b[p] = q;
    } else {
      scanf("%d", &x);
      c[q] = x;
    }
  }
  build(1, Q, 1);
  for (int i = 1; i <= n; i++) a[i] = max(a[i], query(b[i] + 1, Q, 1, Q, 1));
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
