using namespace std;

struct In {

int x; int y;

}s[1000];

int cmp( const void *a , const void *b )

{

struct In *c = (In *)a;

struct In *d = (In *)b;

if(c->x != d->x) return c->x-d->x;

else return c->y-d->y;

}

void work()

{

int i,j,k,n,minv,maxv;

float sum=0.0;

cin>>n;

for(i=0;i<n;i++)

{cin>>s[i].x;

s[i].y=i;

}

qsort(s,n,sizeof(s[0]),cmp);

for(i=0;i<n;i++)

for(j=0;j<i;j++)

sum+=s[j].x;

for(j=0;j<n;j++)

{

s[j].y+=1;

printf("%d ",s[j].y);}

cout<<endl;

sum/=(float)n;

printf("%.2f",sum);

}

int main()

{

freopen("ww.in","r",stdin);

freopen("ww.out","w",stdout);

work();

return 0;

}