#include <bits/stdc++.h>
using namespace std;
int op1[200010], op2[200010];
int suf[200010];
int last[200010];
int lastt[200010];
int cnt;
int main() {
  int n, q;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &last[i]);
    lastt[i] = 1;
  }
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    scanf("%d", &op1[i]);
    if (op1[i] == 1) {
      int op2, op3;
      scanf("%d%d", &op2, &op3);
      last[op2] = op3;
      lastt[op2] = i;
    } else {
      scanf("%d", &op2[i]);
    }
  }
  for (int i = q; i >= 1; i--) {
    suf[i] = suf[i + 1];
    if (op1[i] == 2) suf[i] = max(suf[i], op2[i]);
  }
  for (int i = 1; i <= n; i++) {
    printf("%d ", max(suf[lastt[i]], last[i]));
  }
  printf("\n");
  return 0;
}
