#arc114f. [arc114_f]Permutation Division
[arc114_f]Permutation Division
Problem Statement
You are given a permutation of .
You can divide into exactly non-empty contiguous subsequences as you like.
Maroon will rearrange those subsequences you make and concatenate them to make a new permutation . Here, he will lexicographically maximize .
You want to divide in a way that lexicographically minimizes . Find in that case.
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print when you optimally divide .
Sample Input 1
Sample Output 1
You have two ways to divide : and .
In the former case, Maroon will rearrange them in the order to get .
In the latter case, Maroon will rearrange them in the order to get .
Thus, you should choose the latter.