#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
long long mod = 1e9 + 7;
long long fmod(long long b, long long exp) {
  long long res = 1;
  while (exp) {
    if (exp & 1ll) res = (res * b) % mod;
    b = (b * b) % mod;
    exp /= 2ll;
  }
  return res;
}
int A[N], B[N], val[N], lst[N], mx[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, i, j, k, x, q, ind;
  int t = 1;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> A[i];
  }
  cin >> q;
  int typ;
  memset(B, -1, sizeof(B));
  for (i = 1; i <= q; i++) {
    cin >> typ;
    if (typ == 1) {
      cin >> ind >> x;
      B[ind] = x;
      lst[ind] = i;
    } else {
      cin >> val[i];
    }
  }
  for (int i = q; i >= 1; i--) mx[i] = max(mx[i + 1], val[i]);
  for (i = 1; i <= n; i++) {
    if (B[i] + 1) {
      B[i] = max(mx[lst[i]], B[i]);
    } else {
      B[i] = max(A[i], mx[1]);
    }
  }
  for (i = 1; i <= n; i++) cout << B[i] << " ";
  cout << "\n";
  return 0;
}
