#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 2, MOD = 1e9 + 7;
using vi = vector<int>;
using vp = vector<pair<long long, long long>>;
mt19937 Flash_new_51(515151);
vi simple = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59};
int a[102], prime[100], dp[102][N], p[102][N];
signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 2; i <= 60; i++) {
    for (int j = 0; j < 17; j++) {
      if (i % simple[j] == 0) {
        prime[i] |= (1 << j);
      }
    }
  }
  int mask = (1 << 17);
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j < mask; j++) dp[i][j] = 1e9;
  }
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < mask; j++) {
      for (int tek = 1; tek <= 60; tek++) {
        int lol = prime[tek];
        if (dp[i][j] == 1e9 || (j & lol)) continue;
        int new_mask = j | lol;
        if (dp[i + 1][new_mask] > dp[i][j] + abs(a[i] - tek)) {
          dp[i + 1][new_mask] = dp[i][j] + abs(a[i] - tek);
          p[i + 1][new_mask] = tek;
        }
      }
    }
  }
  int ans = 1e9, imax;
  for (int i = 0; i < mask; i++) {
    if (ans > dp[n][i]) {
      ans = dp[n][i];
      imax = i;
    }
  }
  vector<int> ans1;
  while (n > 0) {
    ans1.push_back(p[n][imax]);
    int lol = prime[p[n][imax]];
    imax = imax - lol;
    n--;
  }
  reverse(ans1.begin(), ans1.end());
  for (auto to : ans1) cout << to << ' ';
}
