#include <bits/stdc++.h>
using namespace std;
inline long long msb(long long val) { return 63 - __builtin_clzll(val); }
inline int msb(int val) { return 31 - __builtin_clz(val); }
template <class T>
bool chmin(T& a, const T& b) {
  return a > b ? a = b, true : false;
}
template <class T>
bool chmax(T& a, const T& b) {
  return a < b ? a = b, true : false;
}
const int mod = 1e9 + 7, N = 2e5 + 5;
int a[N], n, m, k;
int pr[17] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59};
int fact[62];
int dp[101][1 << 17], t[101][1 << 17];
void solve(int test_case) {
  int i, j;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (i = 1; i <= 60; i++) {
    for (j = 0; j < 17; j++) {
      if (i % pr[j] == 0) fact[i] |= (1 << j);
    }
  }
  memset(dp, 0x3f, sizeof dp);
  dp[0][0] = 0;
  for (i = 1; i <= n; i++) {
    for (k = 1; k < 60; k++) {
      int x = (~fact[k]) & ((1 << 17) - 1);
      for (j = x;; j = (j - 1) & x) {
        if (chmin(dp[i][j | fact[k]], dp[i - 1][j] + abs(a[i] - k)))
          t[i][j | fact[k]] = k;
        if (j == 0) break;
      }
    }
  }
  int p = -1, res = mod;
  for (i = 0; i < (1 << 17); i++) {
    if (chmin(res, dp[n][i])) p = i;
  }
  vector<int> ans;
  for (i = n; i >= 1; i--) {
    ans.push_back(t[i][p]);
    p ^= fact[t[i][p]];
  }
  reverse((ans).begin(), (ans).end());
  for (auto x : ans) cout << x << ' ';
  cout << '\n';
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  solve(1);
  return 0;
}
