#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
const int mx = 40;
const int mod = 1e9 + 7;
const long long inf = 34359738370;
const int INF = 1e9 + 7;
int n, q;
int a[maxn];
int sufmax[maxn];
int upclock[maxn];
int change[maxn];
int main() {
  int n;
  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 f, x, v;
    scanf("%d", &f);
    if (f == 1) {
      scanf("%d %d", &x, &v);
      upclock[x] = i;
      a[x] = v;
    } else {
      scanf("%d", &x);
      change[i] = x;
    }
  }
  for (int i = q; i >= 1; i--) {
    sufmax[i] = max(sufmax[i + 1], change[i]);
  }
  for (int i = 1; i <= n; i++) {
    printf("%d ", max(a[i], sufmax[upclock[i] + 1]));
  }
  return 0;
}
