- Time limit: 1.00 s
- Memory limit: 512 MB
- At each step, choose two adjacent elements and swap them.
- At each step, choose any two elements and swap them.
- At each step, choose any element and move it to another position.
- At each step, choose any element and move it to the front of the array.
Input
The first input line contains an integer $n$.
The second line contains $n$ integers describing the permutation.
Output
Print four numbers: the minimum number of steps using each method.
Constraints
- $1 \le n \le 2 \cdot 10^5$
Input:
8
7 8 2 6 5 1 3 4
Output:
20 6 5 6