#IOI2002lxA. Number of Distinct Values
Number of Distinct Values
当前没有测试数据。
Description
You are to write a program, which, given N positive integer values , , …, , compute the number of distinct values in those N integer values.
Format
Input
Your program reads input from standard input. The first line contains one integer: the number N , 2 ≤ N ≤ 1000. The following N lines represent the values , , …, , and each of these lines contains one integer: a value , 1 ≤ ≤ 10000.
Output
Your program writes output to standard output. The output contains one integer: the number of distinct values in , , …, .
Samples
10
1
2
3
4
5
4
3
2
1
2
5
5
123
321
123
231
321
3
Limitation
If the output is correct, you get full score for the test case. Otherwise the score for the test case is 0.