A. Remove Duplicates

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya has an array aa consisting of nn integers. He wants to remove duplicate (equal) elements.

Petya wants to leave only the rightmost entry (occurrence) for each element of the array. The relative order of the remaining unique elements should not be changed.

Input

The first line contains a single integer nn (1≤n≤501≤n≤50) — the number of elements in Petya's array.

The following line contains a sequence a1,a2,…,ana1,a2,…,an (1≤ai≤10001≤ai≤1000) — the Petya's array.

Output

In the first line print integer xx — the number of elements which will be left in Petya's array after he removed the duplicates.

In the second line print xx integers separated with a space — Petya's array after he removed the duplicates. For each unique element only the rightmost entry should be left.

Examples

input

Copy

6
1 5 5 1 6 1

output

Copy

3
5 6 1 

input

Copy

5
2 4 2 4 4

output

Copy

2
2 4 

input

Copy

5
6 6 6 6 6

output

Copy

1
6 

Note

In the first example you should remove two integers 11, which are in the positions 11 and 44. Also you should remove the integer 55, which is in the position 22.

In the second example you should remove integer 22, which is in the position 11, and two integers 44, which are in the positions 22 and 44.

In the third example you should remove four integers 66, which are in the positions 11, 22, 33 and 44.

代码：

#include <iostream>
#include <map>

using namespace std;

int main()
{
    int n;
    int count=0;
    cin>>n;
    int a[55];
    int b[1010];
    fill(b,b+1010,0);
    for(int i=0;i<n;++i)
        cin>>a[i];
    for(int i=n-1;i>=0;--i)
    {
        if(b[a[i]]==1) a[i]=0;
        else{
                count++;
            b[a[i]]=1;
        }
    }
    cout<<count<<endl;
    for(int i=0;i<n;++i)
        if(a[i]!=0) cout<<a[i]<<" ";
    cout<<endl;
    return 0;
}