CF453B.Little Pony and Harmony Chest

Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony.

A sequence of positive integers b__i is harmony if and only if for every two elements of the sequence their greatest common divisor equals 1. According to an ancient book, the key of the chest is a harmony sequence b__i which minimizes the following expression:

You are given sequence a__i, help Princess Twilight to find the key.

暮光公主前往塞拉斯蒂娅与露娜的旧城堡，研究来自和谐之元的宝箱。

一个正整数序列 $b_i$ 被称为和谐序列，当且仅当该序列中任意两个元素的最大公约数均为 1。根据一本古籍记载，宝箱的钥匙即为一个和谐序列 $b_i$，使得下列表达式的值最小：

现给出序列 $a_i$，请帮助暮光公主找出该钥匙。

The first line contains an integer n (1 ≤ n ≤ 100) — the number of elements of the sequences a and b. The next line contains n integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 30).

第一行包含一个整数 $n$（$1 \leq n \leq 100$）—— 序列 $a$ 和 $b$ 的元素个数。
接下来的一行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \leq a_i \leq 30$）。

Output the key — sequence b__i that minimizes the sum described above. If there are multiple optimal sequences, you can output any of them.

输出使上述和最小的关键序列 $b_i$。如果存在多个最优序列，输出其中任意一个即可。