#include<bits/stdc++.h> using namespace std; using ll=long long; ll n,t[1010]; queued[1000010]; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>t[i]; d[t[i]].push(i); } sort(t+1,t+n+1); ll ans=0; for(int i=1;i<=n;i++){ cout<<d[t[i]].front()<<" "; d[t[i]].pop(); ans+=t[i](n-i); } cout<<"\n"; cout<<fixed<<setprecision(2)<<ans1.0/n*1.0<<"\n"; return 0; }