Codeforces Round #447 (Div. 2) C. Marco and GCD Sequence【构造/GCD】

C. Marco and GCD Sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In a dream Marco met an elderly man with a pair of black glasses. The man told him the key to immortality and then disappeared with the wind of time.

When he woke up, he only remembered that the key was a sequence of positive integers of some length n, but forgot the exact sequence. Let the elements of the sequence be a1, a2, ..., an. He remembered that he calculated gcd(ai, ai + 1, ..., aj) for every1 ≤ i ≤ j ≤ n and put it into a set S. gcd here means the greatest common divisor.

Note that even if a number is put into the set S twice or more, it only appears once in the set.

Now Marco gives you the set S and asks you to help him figure out the initial sequence. If there are many solutions, print any of them. It is also possible that there are no sequences that produce the set S, in this case print -1.

Input

The first line contains a single integer m (1 ≤ m ≤ 1000) — the size of the set S.

The second line contains m integers s1, s2, ..., sm (1 ≤ si ≤ 106) — the elements of the set S. It's guaranteed that the elements of the set are given in strictly increasing order, that means s1 < s2 < ... < sm.

Output

If there is no solution, print a single line containing -1.

Otherwise, in the first line print a single integer n denoting the length of the sequence, n should not exceed 4000.

In the second line print n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the sequence.

We can show that if a solution exists, then there is a solution with n not exceeding 4000 and ai not exceeding 106.

If there are multiple solutions, print any of them.

Examples

input

4
2 4 6 12

output

3
4 6 12

input

2
2 3

output

-1

Note

In the first example 2 = gcd(4, 6), the other elements from the set appear in the sequence, and we can show that there are no values different from 2, 4, 6 and 12 among gcd(ai, ai + 1, ..., aj) for every 1 ≤ i ≤ j ≤ n.

【题意】：给你S数列。让你再构造一个数列，使得该数列内gcd(ai, ai + 1, ..., aj) 都出现在S。

【分析】：如果最小元素不是给定集合的GCD，则答案为-1，否则，我们可以在集合的两个连续元素之间插入最小元素。序列长度为2n-1，满足约束条件。

//要求所有之间的gcd都在集合中，所以答案的所有元素的gcd必须在集合中。 此外，gcd（a，b）<= min（a，b），所以答案中所有元素的gcd必须是集合中最小的数字，所以每个数字必须将其分开。那么只需在原数列的相邻两个数ai,ai+1中插入原序列最小的数就这样可以保证gcd不是自己,就是最小的数。 

【代码】：

#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
const int maxn = 1010;

int a[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",a+i);
    if(n==1)
    {
        printf("1
%d",a[1]);
        return 0;
    }

    int ok=1;

    for(int i=2;i<=n;i++)
        if(a[i]%a[1]!=0)
        {
            ok=0;
            break;
        }
        //2 3
        if(!ok)//如果最小元素不是给定集合的GCD，则答案为-1
        {
            printf("-1");
            return 0;
        }

        printf("%d
",(n-1)*2);//否则，我们可以在集合的两个连续元素之间插入最小元素。序列长度为2n-1，满足约束条件。
        for(int i=2;i<=n;i++) printf("%d %d ",a[1],a[i]);
    return 0;
}