#include <bits/stdc++.h>
using namespace std;
const int N = 1005;

struct Node {
    int num;
    int sum;
} a[N];
bool cmp(Node x, Node y) {
    if (x.sum == y.sum)
        return x.num < y.num;
    return x.sum < y.sum;
}
int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i].sum;
        a[i].num = i + 1;
    }
    sort(a, a + n, cmp);
    double temp = 0.00;
    for (int i = 0; i < n; i++) {
        cout << a[i].num << " ";
        temp += (n - (i + 1)) * a[i].sum;
    }
    cout << endl;
    printf("%.2f", temp / n * 1.00);
    return 0;
}