You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Everyone on Earth knows that from $1$ to $n$ ($1≤n≤9$), these $n$ numbers can form $n!$ different permutations. Now, if we sort these $n$ permutations in lexicographical order from smallest to largest, given one permutation, find its previous permutation.

Input Format

The first line contains an integer $n$, representing the length of the permutation.
The second line contains $n$ integers separated by spaces, representing a permutation of the numbers from $1$ to $n$.

Output Format

If the previous permutation exists, output it; otherwise, output "ERROR".

Sample

4
2 1 3 4

1 4 3 2