#include <bits/stdc++.h>
using namespace std;
const int MAXM = 200000;
int a[MAXM + 5];
int lazy[(MAXM << 2) + 5];
inline void push_down(int o, int l, int r) {
  if (lazy[o]) {
    lazy[o << 1] = max(lazy[o << 1], lazy[o]);
    lazy[o << 1 | 1] = max(lazy[o << 1 | 1], lazy[o]);
    lazy[o] = 0;
  }
}
void update1(int o, int l, int r, int x, int v) {
  if (x <= l && r <= x) {
    lazy[o] = 0;
    a[x] = v;
    return;
  } else {
    push_down(o, l, r);
    int m = (l + r) >> 1;
    if (x <= m) update1(o << 1, l, m, x, v);
    if (x >= m + 1) update1(o << 1 | 1, m + 1, r, x, v);
  }
}
void update2(int o, int l, int r, int v) {
  lazy[o] = max(lazy[o], v);
  return;
}
int query(int o, int l, int r, int x) {
  if (x <= l && r <= x) {
    return max(a[x], lazy[o]);
  } else {
    push_down(o, l, r);
    int m = (l + r) >> 1;
    if (x <= m) return query(o << 1, l, m, x);
    if (x >= m + 1) return query(o << 1 | 1, m + 1, r, x);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; ++i) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int x, v;
      scanf("%d%d", &x, &v);
      update1(1, 1, n, x, v);
    } else {
      int x;
      scanf("%d", &x);
      update2(1, 1, n, x);
    }
  }
  for (int i = 1; i <= n; ++i) {
    a[i] = query(1, 1, n, i);
    printf("%d%c", a[i], " \n"[i == n]);
  }
}
