Taco Stamp Albums

In this problem, you are given a collection of stamps where each stamp is represented by an integer value. Your task is to determine the minimum number of albums required to organize the collection such that each album contains stamps of a unique type. In other words, you need to count the number of distinct stamp types in the collection.

Formally, given an integer (N) representing the total number of stamps and a list of (N) integers, the answer is the cardinality of the set formed by these integers. For example, if (N = 6) and the stamps are [2, 3, 2, 5, 3, 2], the answer is 3.

inputFormat

The first line of input contains an integer (N) denoting the total number of stamps. The second line contains (N) space-separated integers representing the type of each stamp. If (N = 0), the second line will be empty.

outputFormat

Output a single integer: the minimum number of albums (i.e., the number of distinct stamp types) needed to organize the collection.## sample

6
2 3 2 5 3 2

3