CodeForces 660ACo-prime Array

Description

You are given an array of n elements, you must make it a co-prime array in as few moves as possible.

In each move you can insert any positive integral number you want not greater than 109 in any place in the array.

An array is co-prime if any two adjacent numbers of it are co-prime.

In the number theory, two integers a and b are said to be co-prime if the only positive integer that divides both of them is 1.

Input

The first line contains integer n (1 ≤ n ≤ 1000) — the number of elements in the given array.

The second line contains n integers ai (1 ≤ ai ≤ 109)
— the elements of the array a.

Output

Print integer k on the first line — the least number of elements needed to add to the array a to make it co-prime.

The second line should contain n + k integers aj — the elements of the array a after
adding k elements to it. Note that the new array should be co-prime, so any two adjacent values should be co-prime. Also the new array should be got from the original array a by
addingk elements to it.

If there are multiple answers you can print any one of them.

题意：给你一个序列，问你需要插入多少个数，使他们任意相邻的数是互质的，输出最终结果，如果相邻的数不互质，那么在他们之间插入一个1，因为1和其他任意正整数互质，（最大公约数为1的两个数互质）

代码如下 ：