#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int a[N];
struct Node {
  int l, r, val;
  Node *left, *right;
  Node(int l, int r) : l(l), r(r), left(nullptr), right(nullptr), val(0){};
  void push() {
    if (!left) {
      a[l] = max(a[l], val);
      val = 0;
      return;
    }
    left->val = max(left->val, val);
    right->val = max(right->val, val);
    val = 0;
  }
};
void build(Node *v) {
  if (v->l == v->r) {
    return;
  }
  int m = (v->l + v->r) / 2;
  v->left = new Node(v->l, m);
  v->right = new Node(m + 1, v->r);
  build(v->left);
  build(v->right);
}
void ch_one(int pos, int val, Node *v) {
  v->push();
  if (v->l > pos || v->r < pos) return;
  if (v->l == pos && v->r == pos) {
    v->val = 0;
    a[v->l] = val;
    return;
  }
  ch_one(pos, val, v->left);
  ch_one(pos, val, v->right);
}
void go(Node *v) {
  v->push();
  if (v->l == v->r) return;
  go(v->left);
  go(v->right);
}
void solve() {
  int n;
  cin >> n;
  for (int i = 1; i <= (int)n; ++i) cin >> a[i];
  Node *root = new Node(1, N - 1);
  build(root);
  int q;
  cin >> q;
  for (int i = 0; i < (int)q; ++i) {
    int e;
    cin >> e;
    if (e == 1) {
      int p, x;
      cin >> p >> x;
      ch_one(p, x, root);
    } else {
      int x;
      cin >> x;
      root->push();
      root->val = x;
    }
  }
  go(root);
  for (int i = 1; i <= (int)n; ++i) cout << a[i] << " ";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
