#include<bits/stdc++.h>
using namespace std;
int n;
int sum1,sum2;
struct node{
	int b,num;
}a[1009];
bool cmp(node c,node d)
{
	return c.b<d.b;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].b;
		a[i].num=i;
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i].num<<" ";
	}
	cout<<endl;
	for(int i=1;i<=n;i++)
	{
		
		if(i>1)
		{
			sum1+=a[i-1].b;
			sum2+=sum1;
		}
		else
		{
			sum1+=0;
		}
	}
	double ans=(double)sum2/(double)n;
	printf("%.2lf",ans);
	return 0;
}