#include <cstdio>
#include <algorithm>
using namespace std;

struct node{
	long long time,num;
};
bool cmp(node a,node b){
	if(a.time==b.time){
		return a.num<b.num;
	}
	return a.time<b.time;
}
node t[1005] = {};
int main()
{
	int n;
	scanf("%d",&n);
	for(int i = 0;i<n;i++){
		scanf("%lld",&t[i].time);
		t[i].num = i+1;
	}
	sort(t,t+n,cmp);
	int sum = 0,rest = n-1;
	for(int i = 0;i<n;i++){
		printf("%d ",t[i].num);
		sum+=(t[i].time*rest--);
	}
	printf("\n%.2lf",double(sum)/n);
	return 0;
}

WA on #3 and #10