A9469. 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.
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.
输入格式
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