Sort Boxes with Unlimited Swaps

Given an integer \(n\) representing the number of boxes and a list of \(n\) integers representing the contents of each box, you are allowed to swap any two boxes any number of times. Since any permutation can always be sorted with enough swaps, the answer will always be Yes.

Note: Although the task might appear non-trivial, it is a trick problem. Mathematically, for any sequence \(A = [a_1, a_2, \dots, a_n]\), there exists a sequence of swaps that can reorder the array into its non-decreasing order, i.e., \(a_1 \le a_2 \le \cdots \le a_n\). Hence, the output is always Yes.

inputFormat

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

• The first line contains an integer \(n\), the number of boxes.
• The second line contains \(n\) space-separated integers representing the values in the boxes.

You do not need to process these numbers since the answer is always Yes.

outputFormat

Print a single line to standard output (stdout) containing the answer: Yes.

## sample

5
4 1 3 2 5

Yes

</p>