One day, when Lauren was walking, she found a permutation of numbers between to . She decided she wanted to minimize the number of inversions in this permutation, so she decided to swap two of the indices. But she is not sure which two indices she should swap so that it minimizes the number of inversions. Can you help her?

Number of inversions in array is the number of pairs such that, and .

Input Format

The first line contains N, which represents the number of elements of the permutation. The next line contains N space-separated elements of the permutation.

Constraints

For full score:
For score:

Output Format

If there isn't any such that, swapping them reduces the number of inversions, print "Cool Array" without the quotes, else print and . If there is more than one pair, print the small one. Consider is smaller than , if or, and .

Sample Input

6
1 5 6 3 4 2

Sample Output

2 6

Explanation

The number of inversions at start are equal to . After swapping, the new permutation will be , and the number of inversions will be

Line: 1 Col: 1
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score