Minimum Distinct Winners

You are given an integer \(n\) and a list of \(n\) ticket numbers. Your task is to determine the minimum number of distinct winners, which is equivalent to the number of unique ticket numbers in the list.

In other words, if the list of tickets is represented as \(a_1, a_2, \dots, a_n\), you need to compute the value of \[ \text{result} = \left| \{ a_1, a_2, \dots, a_n \} \right| \] where \(|S|\) denotes the cardinality of the set \(S\).

Example

Input:
5
1 1 2 2 3
Output:
3

</p>

Here, there are three unique ticket numbers: 1, 2, and 3.

inputFormat

The input is given from standard input (stdin) and consists of two lines:

1. The first line contains a single integer \(n\) (\(1 \leq n \leq 10^5\)) representing the number of tickets.
2. The second line contains \(n\) space-separated integers representing the ticket numbers. Each ticket number is an integer.

outputFormat

Output a single integer to standard output (stdout) which is the minimum number of distinct winners (i.e. the count of unique ticket numbers).

## sample

5
1 1 2 2 3

3

</p>