Deep in the ember dunes of Ashfall, Ulmar studies rows of readings entries. One clean number will settle the guild's oldest argument. Task: Read n integers and print YES if the array is sorted in non-decreasing order, otherwise NO. Input format: First line: n. Second line: n space-separated integers. Output format: Print YES or NO. Constraints: 1 <= n <= 26; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 26; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
