Remove Duplicates (Remove Duplicates)

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_0,a_1,\ldots,a_{n-1}$.

For each value appearing in the array, keep only its rightmost occurrence. The relative order among the retained elements must remain the same as in the original array.

An index $i$ is retained if and only if no equal value appears to its right:

If the retained indices are

print $m$ and

Input

The first line contains integer $n$. The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print the number of remaining elements $m$ on the first line. Print the resulting $m$ elements on the second line.

Subtask

Subtask 1 (100 points): $1\le n\le50$; $1\le a_i\le1000$.

Example

Input

6
1 5 5 1 6 1

Output

3
5 6 1

Explanation

For value $1$, only the occurrence at index 5 remains; for value $5$, only the occurrence at index 2 remains; value $6$ remains. The retained indices are $2,4,5$, so the result is 5 6 1.