#include<iostream> #include<algorithm> #include<cstdio> using namespace std; const int maxn = 1003; typedef pair<int,int> pii; pii a[maxn]; bool cmp(pii a, pii b){ return a.first < b.first; } int main(){ int n; scanf("%d",&n); for(int i = 0; i < n; i++){ scanf("%d",&a[i].first); a[i].second = i+1; } sort(a,a+n,cmp); double sum = 0.0; for(int i = 0;i < n;i++){ sum += a[i].first * (n - i - 1); printf("%d ",a[i].second); } printf("\n%.2lf\n",sum/n); return 0; }