Number of Distinct Values

PROBLEM

You are to write a program, which, given N positive integer values X1, X2, …, XN, compute the number of distinct values in those N integer values.

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 X1, X2, …, XN, and each of these lines contains one integer: a value Xi , 1 ≤ Xi ≤ 10000.

OUTPUT

Your program writes output to standard output. The output contains one integer: the number of distinct values in X1, X2, …, XN.

EXAMPLE INPUTS AND OUTPUTS

Example 1: input		         output

10
1
2
3
4
5
4
3
2
1
2

5

			

Example 2: input		         output

5
123
321
123
231
321

3

SCORING

If the output is correct, you get full score for the test case. Otherwise the score for the test case is 0.