CoderForces 606A Co-prime Array

 Co-prime Array

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 660A

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 10⁹ 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 a_i (1 ≤ a_i ≤ 10⁹) — 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 a_j — 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.

Sample Input

Input

3
2 7 28

Output

1
2 7 9 28
思路：1与任何数互质；
代码：
#include<stdio.h>
#include<string.h>
int num[3000];
int gcd(int a,int b)
{
	if(a%b==0)
	return b;
	else
	return gcd(b,a%b); 
}
int main()
{
	int n;
	int c;
	while(scanf("%d",&n)!=EOF)
	{
		memset(num,0,sizeof(num));
		scanf("%d",&num[0]);
		int t=1,ans=0;
		for(int i=1;i<n;i++)
		{
			scanf("%d",&c);
			if(gcd(c,num[t-1])==1)//把当前的数c与前一个数num[t-1]进行比较；
			{
				num[t++]=c;
			}
			else
			{
				num[t++]=1;
				num[t++]=c;
				ans++;
			}
		}
		printf("%d\n",ans);
		for(int i=0;i<t-1;i++)
		{
			printf("%d ",num[i]);
		}
		printf("%d\n",num[t-1]);
	}
	return 0;
}