#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int MAXN = (1 << 17) + 5;
const int inf = 0x3f3f3f3f;
const int pris[] = {2,  3,  5,  7,  11, 13, 17, 19, 23,
                    29, 31, 37, 41, 43, 47, 53, 59, 233};
int n;
int dp[105][MAXN];
int pre[105][MAXN];
int ans[105][MAXN];
int a[105];
int isp[60] = {1};
int sta[60];
void init() {
  for (int i = 0; i < 17; i++) isp[pris[i]] = 1;
  for (int i = 1; i <= 59; i++) {
    sta[i] = 0;
    for (int j = 0; pris[j] <= i; j++)
      if (i % pris[j] == 0) sta[i] |= (1 << j);
  }
  memset(dp, 0x3f, sizeof(dp));
  memset(ans, 0, sizeof(ans));
  memset(pre, 0, sizeof(pre));
}
int main(int argc, char* argv[]) {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  init();
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < (1 << 17); j++) {
      if (dp[i][j] != inf) {
        for (int k = 1; k <= 59; k++) {
          if (sta[k] & j) continue;
          int nxst = sta[k] | j;
          int nex = dp[i][j] + abs(k - a[i]);
          if (nex < dp[i + 1][nxst]) {
            dp[i + 1][nxst] = nex;
            ans[i + 1][nxst] = k;
            pre[i + 1][nxst] = j;
          }
        }
      }
    }
  }
  int l = 0;
  for (int j = 1; j < 1 << 17; j++)
    if (dp[n][j] < dp[n][l]) l = j;
  vector<int> res;
  res.clear();
  for (int i = n; i > 0; i--) {
    res.push_back(ans[i][l]);
    l = pre[i][l];
  }
  for (int i = res.size() - 1; i >= 0; i--) cout << res[i] << " ";
  return 0;
}
