#include<stdio.h>
#include<stdlib.h>
int sum_t[1005];
struct peo
{
	int num;
	int t;
}p[1005];
int cmp(struct peo* a, struct peo* b)
{
	return a->t - b->t;
}
int main()
{
	int n;
	double ans = 0.00;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &p[i].t);
		p[i].num = i;
	}
	qsort(p + 1, n, sizeof(struct peo), cmp);
	for (int i = 1; i <= n; i++)
	{
		printf("%d ", p[i].num);
	}
	for (int i = 2; i <= n; i++)
	{
		for (int j = 1; j < i; j++)
		{
			sum_t[i] += p[j].t;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		ans += sum_t[i];
	}
	ans /= (n*1.0);
	printf("%.2lf", ans);
	return 0;
}