#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 998244353;
const double EPS = 1e-8;
const double PI = acos(-1);
int sign(double x) { return x < -EPS ? -1 : x > EPS; }
int dbcmp(double l, double r) { return sign(l - r); }
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int MAXN = 1e6 + 54;
int Max[MAXN];
int a[MAXN], b[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (n); (i)++) scanf("%d", &a[i]);
  int m;
  scanf("%d", &m);
  for (int(i) = 1; (i) <= (m); (i)++) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int x, y;
      scanf("%d%d", &x, &y);
      b[x] = i;
      a[x] = y;
    } else {
      int x;
      scanf("%d", &x);
      Max[i] = x;
    }
  }
  for (int(i) = m - 1; (i) >= (0); (i)--) {
    Max[i] = max(Max[i + 1], Max[i]);
  }
  for (int(i) = 1; (i) <= (n); (i)++) {
    printf("%d ", max(Max[b[i]], a[i]));
  }
}
