#include <bits/stdc++.h>
using namespace std;
const int p[17] = {2,  3,  5,  7,  11, 13, 17, 19, 23,
                   29, 31, 37, 41, 43, 47, 53, 59};
int n, a[101], mask[60], f[101][1 << 17], trace[101][1 << 17],
    ele[101][1 << 17];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= 59; ++i)
    for (int j = 0; j < 17; ++j)
      if (i % p[j] == 0) mask[i] |= (1 << j);
  for (int i = 0; i <= n; ++i)
    for (int j = 0; j < (1 << 17); ++j) f[i][j] = 1e9;
  f[0][0] = 0;
  int res = 1e9, state;
  for (int i = 1; i <= n; ++i) {
    for (int prevMask = 0; prevMask < (1 << 17); ++prevMask) {
      if (i == 1 && prevMask > 0) break;
      for (int j = 1; j <= 59; ++j) {
        if ((prevMask & mask[j]) > 0) continue;
        if (f[i - 1][prevMask] + abs(a[i] - j) < f[i][prevMask | mask[j]]) {
          f[i][prevMask | mask[j]] = f[i - 1][prevMask] + abs(a[i] - j);
          trace[i][prevMask | mask[j]] = prevMask;
          ele[i][prevMask | mask[j]] = j;
        }
        if (i == n && f[i][prevMask | mask[j]] < res) {
          res = f[i][prevMask | mask[j]];
          state = prevMask | mask[j];
        }
      }
    }
  }
  vector<int> ans;
  for (int i = n; i >= 1; --i) {
    ans.push_back(ele[i][state]);
    state = trace[i][state];
  }
  for (int i = n - 1; i >= 0; --i) cout << ans[i] << ' ';
  return 0;
}
