#include<bits/stdc++.h>
using namespace std;#definelllonglongconstint N =200005;int n, a[N], c[N], great[N], lower[N];intlowbit(int x){
return x &-x;}voidinsert(int x,int y){
while(x <= n){
c[x]+= y;
x +=lowbit(x);}}intsum(int x){
int all =0;while(x >0){
all += c[x];
x -=lowbit(x);}return all;}intmain(){
scanf("%d",&n);for(int i =1; i <= n; i ++)scanf("%d",&a[i]);for(int i =1; i <= n; i ++){
great[i]=sum(n)-sum(a[i]);
lower[i]=sum(a[i]-1);insert(a[i],1);}memset(c,0,sizeof c);
ll res1 =0, res2 =0;for(int i = n; i; i --){
res1 +=1LL* great[i]*(sum(n)-sum(a[i]));
res2 +=1LL* lower[i]*sum(a[i]-1);insert(a[i],1);}printf("%lld %lld\n", res1, res2);return0;}