#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 10000000000;
const int MX = 2e5 + 7;
const int mod = 998244353;
const int maxbit = 20;
int n;
long long t[MX << 4];
long long a[MX];
long long lazy[MX << 4];
inline void push_up(int rt) { t[rt] = min(t[rt << 1], t[rt << 1 | 1]); }
inline void build(int l, int r, int rt) {
  if (l == r) {
    t[rt] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, rt << 1);
  build(mid + 1, r, rt << 1 | 1);
  push_up(rt);
}
inline void f(int rt, long long k) {
  t[rt] = max(t[rt], k);
  lazy[rt] = max(lazy[rt], k);
}
inline void push_down(int rt) {
  f(rt << 1, lazy[rt]);
  f(rt << 1 | 1, lazy[rt]);
  lazy[rt] = 0;
}
inline void update(int p, int l, int r, int rt, long long k) {
  if (l == r) {
    t[rt] = k;
    return;
  }
  push_down(rt);
  int mid = (l + r) >> 1;
  if (p <= mid)
    update(p, l, mid, rt << 1, k);
  else
    update(p, mid + 1, r, rt << 1 | 1, k);
  push_up(rt);
}
inline void P(int l, int r, int rt) {
  if (l == r) {
    cout << t[rt] << " ";
    return;
  }
  push_down(rt);
  int mid = (l + r) >> 1;
  P(l, mid, rt << 1);
  P(mid + 1, r, rt << 1 | 1);
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  build(1, n, 1);
  int q;
  cin >> q;
  while (q--) {
    int op;
    cin >> op;
    if (op == 1) {
      int p, x;
      cin >> p >> x;
      update(p, 1, n, 1, x);
    } else {
      int k;
      cin >> k;
      if (t[1] >= k)
        continue;
      else {
        t[1] = k;
        lazy[1] = k;
        push_down(1);
      }
    }
  }
  P(1, n, 1);
  cout << endl;
  return 0;
}
