#include <bits/stdc++.h>
using namespace std;
const int maxn = 200003;
struct node {
  int val, z;
} t[maxn << 2];
int n, Q;
void pushdown(int p, int l, int r) {
  if (l == r) {
    t[p].val = max(t[p].val, t[p].z), t[p].z = 0;
    return;
  }
  t[p << 1].z = max(t[p << 1].z, t[p].z);
  t[p << 1 | 1].z = max(t[p << 1 | 1].z, t[p].z);
  t[p].z = 0;
}
void build(int p, int l, int r) {
  if (l == r) {
    scanf("%d", &t[p].val);
    return;
  }
  int mid = (l + r) >> 1;
  build(p << 1, l, mid);
  build(p << 1 | 1, mid + 1, r);
}
void change(int p, int l, int r, int pos, int k) {
  pushdown(p, l, r);
  if (l == r) {
    t[p].val = k;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    change(p << 1, l, mid, pos, k);
  else
    change(p << 1 | 1, mid + 1, r, pos, k);
}
int query(int p, int l, int r, int pos) {
  pushdown(p, l, r);
  if (l == r) return t[p].val;
  int mid = (l + r) >> 1;
  if (pos <= mid)
    return query(p << 1, l, mid, pos);
  else
    return query(p << 1 | 1, mid + 1, r, pos);
}
int main() {
  scanf("%d", &n);
  build(1, 1, n);
  scanf("%d", &Q);
  int mo, x, y;
  while (Q--) {
    scanf("%d%d", &mo, &x);
    if (mo == 1) {
      scanf("%d", &y);
      change(1, 1, n, x, y);
    } else {
      pushdown(1, 1, n);
      t[1].z = x;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", query(1, 1, n, i));
  return 0;
}
