Unique Candy Distribution

You are given the number of children and a list of integers representing the number of candies each child currently has. Your task is to determine whether it is possible to have a distribution of candies where every child receives a unique number of candies. The output should be "Yes" if the candies are already uniquely distributed, otherwise "No".

Note: The problem is simplified to checking if there are any duplicate candy counts among the children.

The mathematical condition can be expressed as: $$|\{a_1, a_2, \dots, a_n\}| = n$$, where \(a_i\) denotes the candy count for the \(i^{th}\) child.

inputFormat

The first line of input contains an integer \(n\) denoting the number of children. The second line contains \(n\) space-separated integers representing the candies each child has.

outputFormat

Output a single line containing either "Yes" if all the candy counts are unique, or "No" if there is any duplicate value.

## sample

5
1 5 9 3 7

Yes

</p>