题库练习 Little Pony and Harmony Chest
← 上一题 下一题 →

A9469 | Little Pony and Harmony Chest

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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

![](/uploads/acgo/image/60986ce2f11f8e70_f1b27affc11d.jpeg)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:

![](/uploads/acgo/image/fa50b4e1509866a3_7346f8224524.jpeg)You are given sequence $a_{i}$ , help Princess Twilight to find the key.

输入格式

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$ ).

输出格式

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

输入输出样例

输入 #1
5
1 1 1 1 1
输出 #1
1 1 1 1 1 
输入 #2
5
1 6 4 2 8
输出 #2
1 5 3 1 8 
C++ 编辑器
输入
输出