#include<bits/stdc++.h>
using namespace std;
struct node 
{
	int pp;
    int ss;
};
bool cmp(node x1,node x2) 
{
	if (x1.ss<x2.ss)
	return 1;
	else
	return 0;
}
int main(){
    node a[101000];
    int i,n,j,time=0,k,x,max,sum=0,t=-2;
    cin>>n;
	for (i=1;i<=n;i++)
	{
		cin>>a[i].ss;
		a[i].pp=i;
	}
	
	sort(a+1,a+n+1,cmp);
	for (i=1;i<=n;i++)
	{
		time=time+a[i].ss*(n-i);
	}
	for (i=1;i<=n;i++)
	{
		cout<<a[i].pp<<" ";
	}
	cout<<endl;
	cout<<fixed<<setprecision(2)<<1.0*time/n;
}