#include <bits/stdc++.h>
using namespace std;
const int sqr = 1000;
const long long P = (1000 * 1000 * 1000) + 7;
const int arrn = 1e5 + 5;
const int arrn2 = 1e3;
int n;
int in[101] = {};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59};
int divi[61] = {};
set<int> temp;
void pre() {
  for (int i = 1; i < 61; i++) {
    int k = 0;
    int j = 0;
    while (j < 17) {
      if (i % prime[j] == 0) {
        k |= (1 << j);
      }
      while (!i % prime[j]) i /= prime[j];
      j++;
    }
    divi[i] = k;
    temp.insert(k);
  }
}
int ans[102][(1 << 17)] = {};
int val[102][(1 << 17)] = {};
int bef[102][(1 << 17)] = {};
bool te = 1;
void sol() {
  for (int i = 1; i < n + 1; i++) {
    for (int b = 1; b < 61; b++) {
      for (int j = 0; j < (1 << 17); j++) {
        if (ans[i - 1][j] != INT_MAX && (j & divi[b]) == 0) {
          if (ans[i][j | divi[b]] > ans[i - 1][j] + abs(in[i - 1] - b)) {
            ans[i][j | divi[b]] = ans[i - 1][j] + abs(in[i - 1] - b);
            val[i][j | divi[b]] = b;
            bef[i][j | divi[b]] = j;
          }
        }
      }
    }
  }
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> in[i];
  for (int i = 0; i < 102; i++) {
    for (int j = 0; j < (1 << 17); j++) {
      if (i == 0)
        ans[i][j] = 0;
      else
        ans[i][j] = INT_MAX;
    }
  }
  pre();
  sol();
  int ans1 = INT_MAX;
  int k = 0;
  for (int i = 0; i < (1 << 17); i++) {
    if (ans1 > ans[n][i]) {
      ans1 = ans[n][i];
      k = i;
    }
  }
  int i = n;
  int ret[102] = {};
  while (i != 0) {
    ret[i] = val[i][k];
    k = bef[i][k];
    i--;
  }
  for (int i = 0; i < n; i++) cout << ret[i + 1] << ' ';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int T;
  T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
