#include <bits/stdc++.h>
using namespace std;
typedef vector<vector<int> > VVI;
typedef priority_queue<int, vector<int>, greater<int> > PQ;
const int MAX = 2e5 + 10, MOD = 1e9 + 7;
int A[MAX], change[MAX], Q[MAX], U[MAX];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ;
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> A[i];
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int type;
    cin >> type;
    if (type == 1) {
      int x, y;
      cin >> x >> y;
      A[x] = y;
      Q[i] = -1;
      U[x] = i;
    } else {
      int x;
      cin >> x;
      change[i] = x;
      Q[i] = x;
    }
  }
  for (int i = q; i >= 1; i--) change[i] = max(change[i + 1], Q[i]);
  for (int i = 1; i <= n; i++) cout << max(A[i], change[U[i] + 1]) << " ";
  return 0;
}
