After you have read all the problems, probably, you think Alex is genius person. That's true! One day he came up with the following task.

Given a sequence of integer numbers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$. You are to find a longest sequence $*b*_{1}, *b*_{2}, ..., *b*_{4*m*}$, that satisfies the following conditions:

• $*b*_{4*k* + 1} = *b*_{4*k* + 3}$ for all valid integer $*k*$;
• $*b*_{4*k* + 2} = *b*_{4*k* + 4}$ for all valid integer $*k*$;
• sequence $*b*$ is subsequence of $*a*$ (not necessarily contiguous subsequence).

And finally... Alex had given this complicated task to George, and George gave it to you. Help George to cope with the task.

Input

The first line contains a single integer $*n*$ $(1 ≤ *n* ≤ 5·10^{5})$. The next line contains $*n*$ integers $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ $(1 ≤ *a*_{*i*} ≤ 10^{9})$.

Output

In the first line print a single integer $4*m*$ — the maximal possible length of required sequence $*b*$. In the second line print $4*m*$ integers $*b*_{1}, *b*_{2}, ..., *b*_{4*m*}$, that is required sequence.

If there are multiple optimal answers you may print any of them.