#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 10;
const int P = 60;
const int S = 1 << 17;
const int INF = 1 << 27;
int prime[P], flag[P], totPrimes, b[P];
int a[N], c[N];
int f[N][S], g[N][S];
int n;
void makeTable() {
  for (int i = 2; i < P; ++i)
    if (!flag[i]) {
      prime[totPrimes++] = i;
      for (int j = i + i; j < P; j += i) flag[j] = 1;
    }
  for (int i = 1; i < P; ++i)
    for (int j = 0; j < totPrimes; ++j)
      if (i % prime[j] == 0) b[i] |= 1 << j;
}
int main() {
  makeTable();
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 0; i <= n; ++i)
    for (int j = 0; j < S; ++j) f[i][j] = INF;
  f[0][0] = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < S; ++j) {
      if (f[i][j] == INF) continue;
      for (int k = 1; k < a[i + 1] * 2; ++k) {
        if (j & b[k]) continue;
        if (f[i][j] + abs(a[i + 1] - k) < f[i + 1][j | b[k]]) {
          f[i + 1][j | b[k]] = f[i][j] + abs(a[i + 1] - k);
          g[i + 1][j | b[k]] = k;
        }
      }
    }
  int u = 0;
  for (int i = 1; i < S; ++i)
    if (f[n][i] < f[n][u]) u = i;
  for (int i = n; i; --i) {
    c[i] = g[i][u];
    u = u ^ b[g[i][u]];
  }
  for (int i = 1; i <= n; ++i) printf("%d ", c[i]);
  printf("\n");
  return 0;
}
