Descending Order Ball Sorting

You are given a sequence of n balls, each with an integer weight. The task is to determine whether it is possible to sort these balls in descending order using the allowed operations. In this problem, you can perform any number of adjacent swaps, which means that in any permutation of balls its possible to reorder them arbitrarily.

The underlying mathematical fact is that any permutation can be sorted using adjacent swaps. However, some operations such as completely reversing the list may immediately give the sorted order if the original list is the ascending order.

The input consists of the number of balls and their respective weights. Your program should output True if it is possible to achieve the desired arrangement and False otherwise.

Note: According to the problem constraints and allowed operations, any permutation is sortable, so the expected answer is always True.

inputFormat

The first line of input contains an integer n denoting the number of balls. The second line contains n integers separated by spaces, representing the weights of the balls.

outputFormat

Output a single line containing either True or False (without quotes). For this problem, since any permutation of balls can be sorted using adjacent swaps, the output should always be True.

5
1 2 3 4 5

True