#include <bits/stdc++.h>
using namespace std;
int dp[105][1 << 17];
pair<int, int> trace[105][1 << 17];
int prime[17] = {2,  3,  5,  7,  11, 13, 17, 19, 23,
                 29, 31, 37, 41, 43, 47, 53, 59};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = 1; i <= n; i++) cin >> a[i];
  int f[61];
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= 60; i++)
    for (int j = 0; j < 17; j++)
      if (i % prime[j] == 0) f[i] |= (1 << j);
  for (int i = 0; i < 105; i++)
    for (int j = 0; j < (1 << 17); j++) dp[i][j] = 1000000007;
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (1 << 17); j++) {
      for (int k = 1; k <= 60; k++) {
        if ((j & f[k]) == 0) {
          if (dp[i][j | f[k]] > dp[i - 1][j] + abs(a[i] - k)) {
            dp[i][j | f[k]] = dp[i - 1][j] + abs(a[i] - k);
            trace[i][j | f[k]] = make_pair(j, k);
          }
        }
      }
    }
  }
  vector<int> ans;
  int mn = 1000000007;
  int mask;
  for (int i = 0; i < (1 << 17); i++) {
    if (dp[n][i] < mn) {
      mn = dp[n][i];
      mask = i;
    }
  }
  int pos = n;
  while (pos > 0) {
    ans.push_back(trace[pos][mask].second);
    mask = trace[pos--][mask].first;
  }
  for (int i = ans.size() - 1; i >= 0; i--) cout << ans[i] << " ";
  return 0;
}
