Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Marco and GCD Sequence

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn 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 *a*_{1}, *a*_{2}, ..., *a*_{n}. He remembered that he calculated *gcd*(*a*_{i}, *a*_{i + 1}, ..., *a*_{j}) for every 1 ≤ *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 *s*_{1}, *s*_{2}, ..., *s*_{m} (1 ≤ *s*_{i} ≤ 10^{6}) — the elements of the set *S*. It's guaranteed that the elements of the set are given in strictly increasing order, that means *s*_{1} < *s*_{2} < ... < *s*_{m}.

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 *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{6}) — the sequence.

We can show that if a solution exists, then there is a solution with *n* not exceeding 4000 and *a*_{i} not exceeding 10^{6}.

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*(*a*_{i}, *a*_{i + 1}, ..., *a*_{j}) for every 1 ≤ *i* ≤ *j* ≤ *n*.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/18/2017 11:51:09 (c5).

Desktop version, switch to mobile version.

User lists

Name |
---|