Description

There are $n$ people waiting in line at a water tap. If the time for the $i$-th person to fill water is $T_i$, please write a program to find a queuing order for these $n$ people that minimizes the average waiting time.

Input Format

The input consists of two lines. The first line contains $n$ ($1 ≤ n ≤ 1000$). The second line contains $n$ integers $T_1$, $T_2$, ..., $T_n$ representing the water filling time for each person from 1 to $n$, separated by spaces. It is guaranteed that all $T_i$ values are distinct.

Output Format

The output consists of two lines. The first line contains a queuing order, which is a permutation of numbers from 1 to $n$. The second line contains the average waiting time for this arrangement (accurate to two decimal places).

Sample

10
56 12 1 99 1000 234 33 55 99 812

3 2 7 8 1 4 9 6 10 5
291.90