CodeForces 978A Remove Duplicates（模拟）

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

6
1 5 5 1 6 1

Output

3
5 6 1 

Input

5
2 4 2 4 4

Output

2
2 4 

Input

5
6 6 6 6 6

Output

1
6 

Note

In the first example you should remove two integers 11, which are in the positions 11and 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.

题意：给出n个数，输出有多少个不同的数，并按每个数最后一次出现的顺序输出来。

解题思路：从后往前遍历，如果出现一次不同的数就保存在数组里，遍历后输出数组中的数即可。

AC代码：

#include<stdio.h>
#include<string.h>

int a[1010],b[1010],book[1010];

int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		memset(book,0,sizeof(book));
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
		}
		int j=0;
		for(int i=n-1;i>=0;i--)
		{
			
			if(book[a[i]]==0)
			{
				book[a[i]]=1;
				b[j++]=a[i];
			}
		}
		printf("%d\n",j);
		int flag=0;
		for(int i=j-1;i>=0;i--)
		{
			if(flag) printf(" %d",b[i]);
			if(flag==0)
			{
				printf("%d",b[i]);
				flag=1;
			}
		}
		printf("\n");
	}
	return 0;
}