#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 10;
const int M = 70;
const int C = 13;
const int INF = 0x3f3f3f3f;
vector<int> p;
int vis[M];
int f[N][1 << 16];
pair<int, int> path[N][1 << 16];
int atom[M], n, a[N];
void build() {
  for (int i = 2; i < 59; ++i) {
    if (!vis[i]) {
      p.push_back(i);
      for (int j = i; j < M; j += i) {
        vis[j] = 1;
      }
    }
  }
  for (int i = 1; i < 54; ++i) {
    atom[i] = 0;
    for (int j = 0; j < p.size(); ++j) {
      if (i % p[j] == 0) atom[i] |= 1 << j;
    }
  }
}
void print(int x, int y) {
  if (x == 0) return;
  print(x - 1, path[x][y].second);
  printf("%d ", path[x][y].first);
}
void init() {
  scanf("%d", &n);
  memset(f, 0x3f, sizeof(f));
  ;
  f[0][0] = 0;
}
void solve() {
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    for (int j = 0; j < (1 << 16); ++j) {
      if (f[i - 1][j] == INF) continue;
      for (int k = 1; k < 54; ++k) {
        if (j & atom[k]) continue;
        if (f[i - 1][j] + abs(k - a[i]) < f[i][j | atom[k]]) {
          f[i][j | atom[k]] = f[i - 1][j] + abs(k - a[i]);
          path[i][j | atom[k]].first = k;
          path[i][j | atom[k]].second = j;
        }
      }
    }
  }
  int sum = INF;
  int answer;
  for (int j = 0; j < (1 << 16); ++j) {
    if (f[n][j] < sum) {
      sum = f[n][j];
      answer = j;
    }
  }
  print(n, answer);
}
int main() {
  init();
  build();
  solve();
}
