#include <bits/stdc++.h>
using namespace std;
vector<long long int> a, t, lazy;
void push(int v) {
  lazy[v + v] = max(lazy[v + v], lazy[v]);
  lazy[v + v + 1] = max(lazy[v + v + 1], lazy[v]);
  lazy[v] = 0;
}
void update(int v, int tl, int tr, int pt, int x) {
  if (tl == tr) {
    a[tl] = x;
    lazy[v] = 0;
  } else {
    push(v);
    int tm = (tl + tr) / 2;
    if (pt <= tm)
      update(v + v, tl, tm, pt, x);
    else {
      update(v + v + 1, tm + 1, tr, pt, x);
    }
  }
}
int get_value(int v, int tl, int tr, int pt) {
  if (tl == tr) {
    a[tl] = max(lazy[v], a[tl]);
    return a[tl];
  } else {
    int tm = (tl + tr) / 2;
    push(v);
    if (pt <= tm)
      return get_value(v + v, tl, tm, pt);
    else
      return get_value(v + v + 1, tm + 1, tr, pt);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  t.resize(4 * n);
  a.resize(n);
  lazy.resize(4 * n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  int q;
  cin >> q;
  long long int p, x, y;
  while (q--) {
    cin >> y;
    if (y == 1) {
      cin >> p >> x;
      update(1, 0, n - 1, p - 1, x);
    } else {
      cin >> x;
      push(1);
      lazy[1] = max(lazy[1], x);
    }
  }
  for (int i = 0; i < n; i++) cout << get_value(1, 0, n - 1, i) << " ";
}
