#include<cstdio>
#include<algorithm>
#define N 100010
typedef long long ll;
int n,i,a[N],b[N],c[N],d[N],e[N],f[N];ll bit[N],c1,c2,c3,c4,c5,c6,all;
inline void read(int&a){char c;while(!(((c=getchar())>='0')&&(c<='9')));a=c-'0';while(((c=getchar())>='0')&&(c<='9'))(a*=10)+=c-'0';}
inline int lower(int x){int l=1,r=n,mid,t;while(l<=r)if(b[mid=(l+r)>>1]<=x)l=(t=mid)+1;else r=mid-1;return t;
}
inline void add(int x,int y){for(;x<=n;x+=x&-x)bit[x]+=y;}
inline ll ask(int x){ll t=0;for(;x;x-=x&-x)t+=bit[x];return t;}
void write(ll x){for(printf("0."),i=0;i<20;i++)x*=10,printf("%d",x/all),x%=all;puts("");}
int main(){for(read(n),i=1;i<=n;i++)read(a[i]),b[i]=a[i];for(std::sort(b+1,b+n+1),i=1;i<=n;i++)a[i]=lower(a[i]);for(i=1;i<=n;i++)b[i]=ask(a[i]-1),c[i]=i-1-ask(a[i]),add(a[i],1);for(i=1;i<=n;i++)bit[i]=0;for(i=n;i;i--)d[i]=ask(a[i]-1),f[i]=ask(a[i]),e[i]=n-i-f[i],add(a[i],1);for(i=1;i<=n;i++)bit[i]=0;for(i=n;i;i--){c1+=1LL*b[i]*e[i],c6+=1LL*c[i]*d[i];c5+=1LL*b[i]*c[i],c2+=ask(a[i]-1)-1LL*d[i]*(d[i]-1)/2,add(a[i],b[i]+f[i]);}c5-=c2;for(i=1;i<n-i+1;i++)std::swap(a[i],a[n-i+1]);for(i=1;i<=n;i++)bit[i]=0;for(i=1;i<=n;i++)b[i]=ask(a[i]-1),c[i]=i-1-ask(a[i]),add(a[i],1);for(i=1;i<=n;i++)bit[i]=0;for(i=n;i;i--)d[i]=ask(a[i]-1),f[i]=ask(a[i]),add(a[i],1);for(i=1;i<=n;i++)bit[i]=0;for(i=n;i;i--)c3+=1LL*b[i]*c[i],c4+=ask(a[i]-1)-1LL*d[i]*(d[i]-1)/2,add(a[i],b[i]+f[i]);c3-=c4;all=c1+c2+c3+c4+c5+c6;write(c1),write(c2),write(c3),write(c4),write(c5),write(c6);return 0;
}