Second Smallest Unique Element

Given a list of integers, your task is to identify the second smallest unique element. In other words, if you extract all unique elements from the list and sort them in ascending order, you must output the element in the second position. If there is no such element, output No second smallest unique element.

For example, if the input list is ({3, 1, 5, 3, 7, 2, 2, 1}), the unique elements are ({1, 2, 3, 5, 7}) and the second smallest is (2).

All formulas are rendered in (\LaTeX) format.

inputFormat

The input is given via standard input (stdin) in the following format:
1. The first line contains an integer (n), representing the number of elements in the list.
2. If (n > 0), the second line contains (n) space-separated integers.

outputFormat

Output the second smallest unique element. If there is no second smallest unique element, output the exact string No second smallest unique element.## sample

8
3 1 5 3 7 2 2 1

2