#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,p,s;
struct nd{
	int x,y;
}a[1002];
bool cmp(nd a,nd b){
	return a.x<b.x;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x;
		a[i].y=i;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++) cout<<a[i].y<<" ";
	cout<<endl;
	p=0;s=a[1].x;
	for(int i=2;i<=n;i++){
		p+=s;s+=a[i].x;
	}
	printf("%.2lf",1.00*p/n);
	return 0;
}