#include <bits/stdc++.h>
using namespace std;
void solve() {
  int long long n, k;
  cin >> n;
  int long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int long long m;
  cin >> m;
  vector<int long long> v(m, 0), b(n, 0);
  int long long i = 0;
  while (i < m) {
    int long long x, y, z;
    cin >> x;
    if (x == 1) {
      cin >> y >> z;
      y--;
      a[y] = z;
      b[y] = i;
    } else {
      cin >> y;
      v[i] = y;
    }
    i++;
  }
  for (i = v.size() - 1; i >= 0; i--) {
    if (i == v.size() - 1)
      continue;
    else {
      v[i] = max(v[i + 1], v[i]);
    }
  }
  for (i = 0; i < n; i++) {
    cout << max(a[i], v[b[i]]) << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
