Queue for Water

Problem Description

There are $n$ people queuing in front of a tap to get water. Suppose the $i$-th person takes $T_i$ time to get water. Find an ordering of the $n$ people such that their average waiting time is minimized.

Input Format

The first line is an integer $n$.

The second line contains $n$ integers, where the $i$-th integer $T_i$ is the water-fetching time of the $i$-th person.

Output Format

Output two lines. The first line is an ordering that gives the shortest average waiting time. The second line is the average waiting time under this ordering (kept to two decimal places).

Sample Input

10
56 12 1 99 1000 234 33 55 99 812

Sample Output

3 2 7 8 1 4 9 6 10 5
532.00

Constraints

$1\le n \leq 1000$, $1\le t_i \leq 10^6$; the $t_i$ are not guaranteed to be distinct.