一道巨简单的签到题

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 $a$ consisting of $n$ 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 $n$ ($1\le n\le 50$) — the number of elements in Petya's array.

The following line contains a sequence $a_1,a_2,\dots ,a_n$ ($1\le a_i\le 1000$) — the Petya's array.

Output

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

In the second line print $x$ 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 $1$, which are in the positions $1$ and $4$. Also you should remove the integer $5$, which is in the position $2$.

In the second example you should remove integer $2$, which is in the position $1$, and two integers $4$, which are in the positions $2$ and $4$.

In the third example you should remove four integers $6$, which are in the positions $1$, $2$, $3$ and $4$.

大概意思就是给你一行用空格隔开的几个数，筛选重复的数，要求从右到左，重复的只保留一个，统计不重复的一共有多少个数，并且按照从右往左的顺序输出！

博主用了一种标记数组，AC代码如下：

#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
	int n,a[1001],j=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	   scanf("%d",&a[i]);
	int b[1001],v[1001]={0};
	for(int i=n-1;i>=0;i--){
		if(v[a[i]]==0){      //用v[]记录一下数组a[i]，重复出现的话下次就不需要再讨论了
			v[a[i]]=1;
			b[j++]=a[i];
		}
	}
	printf("%d\n",j);
	for(int k=j-1;k>=0;k--)
	   printf("%d%c",b[k],k==0?'\n':' ');
	return 0;
}