#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 2e5 + 10;
const ll inf = 1e15 + 42;
void testCase() {
  int n, q;
  cin >> n;
  ll a[n + 3];
  for (int i = 1; i <= n; i++) cin >> a[i];
  cin >> q;
  int p[200005];
  ll x[200005];
  for (int i = 1; i <= q; i++) {
    int ty;
    cin >> ty;
    if (ty == 1)
      cin >> p[i] >> x[i];
    else {
      p[i] = -1;
      cin >> x[i];
    }
  }
  ll mx = 0;
  int seen[200005] = {0};
  for (int i = q; i > 0; i--) {
    ll p1 = p[i];
    ll x1 = x[i];
    if (p1 == -1) {
      mx = max(mx, x1);
    } else if (!seen[p1]) {
      seen[p1] = 1;
      a[p1] = max(mx, x1);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!seen[i]) a[i] = max(mx, a[i]);
  }
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  cout << "\n";
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  testCase();
  return 0;
}
