#include <bits/stdc++.h>
using namespace std;
int dp[101][1 << 18], id[66], a[111];
int ans[101][1 << 18], b[111], p[111], mask[111];
int main() {
  int n, cnt = 0;
  for (int i = 2; i <= 60; i++) {
    int flag = 0;
    for (int j = 2; j < i; j++)
      if (i % j == 0) flag = 1;
    if (!flag) p[cnt++] = i;
  }
  for (int i = 1; i <= 60; i++) {
    for (int j = 0; j < cnt; j++) {
      if (i % p[j] == 0) mask[i] |= (1 << j);
    }
  }
  cin >> n;
  memset(dp, 0x3f3f3f3f, sizeof(dp));
  for (int i = 1; i <= n; i++) cin >> a[i];
  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 (mask[k] & j) continue;
        if (dp[i - 1][j] + abs(a[i] - k) < dp[i][j | mask[k]]) {
          dp[i][j | mask[k]] = dp[i - 1][j] + abs(a[i] - k);
          ans[i][j | mask[k]] = k;
        }
      }
    }
  }
  int minn = 0x3f3f3f3f;
  int mins = 0;
  for (int i = 0; i < (1 << 17); i++) {
    if (dp[n][i] < minn) {
      minn = dp[n][i];
      mins = i;
    }
  }
  for (int i = n; i >= 1; i--) {
    b[i] = ans[i][mins];
    mins -= mask[b[i]];
  }
  for (int i = 1; i <= n; i++) cout << b[i] << ' ';
  cout << endl;
  return 0;
}
