#include<iostream>
#include<algorithm>
#include<cstdio>
#define maxn 1010
using namespace std;
struct water{
    int time,num;
}ns[maxn];
bool cmp(water a,water b){
    if(a.time!=b.time)return a.time<b.time;
    return a.num<b.num;
}
int ans=0;
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&ns[i].time),ns[i].num=i;
    sort(ns+1,ns+n+1,cmp);
    for(int i=1;i<=n;i++){
        printf("%d ",ns[i].num);
        ans+=i*ns[n-i].time;
    }
    printf("\n%.2lf\n",1.0*ans/n);
    return 0;
}

总有一个测试点过不了，但思想与洛谷书上一样