Maximum Unique Chocolate Distribution

You are given an integer \(N\) and a list of \(N\) integers representing the types of chocolates. Each integer represents a specific kind of chocolate.

Your task is to determine the maximum number of children that can be given a chocolate such that no two children receive the same kind of chocolate. In mathematical terms, if the list of chocolates is \(A = [a_1, a_2, \dots, a_N]\), you need to compute \[ \text{result} = \left| \{ a_i : 1 \le i \le N \} \right| \] which represents the number of unique chocolate types.

Note: You must read the input from standard input (stdin) and write the output to standard output (stdout).

inputFormat

The first line of input contains an integer \(N\) which represents the number of chocolates.

The second line contains \(N\) space-separated integers representing the types of the chocolates.

outputFormat

Output a single integer, which is the maximum number of children that can be given chocolates such that no two children receive the same type.

## sample

4
4 3 2 1

4

</p>