#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cstring>
#include<cmath>
#define ll long long 
#define eps 1e-4
using namespace std;
//priority_queue<int,vector<int>,greater<int> > q1;
//priority_queue<int> q2;
//std::set<int> s;
//list<int> l;
//map<int> mp;
//queue<int> q;
inline ll read(){
    ll ret=0,f=1;char ch=getchar();
    while (ch<‘0‘||ch>‘9‘) {if (ch==‘-‘) f=-f;ch=getchar();}
    while (ch>=‘0‘&&ch<=‘9‘) ret=ret*10+ch-‘0‘,ch=getchar();
    return ret*f;
}
inline void write(ll zx){
    if(zx<0){zx=-zx;putchar(‘-‘);}
    if(zx<10) putchar(zx+‘0‘);
    else{
        write(zx/10);
        putchar(zx%10+‘0‘);
    }
}

struct data{
    ll lc,rc,key,pri,cnt,sze;
    #define lc(x) t[x].lc
    #define rc(x) t[x].rc
    #define v(x) t[x].key
    #define p(x) t[x].pri
    #define c(x) t[x].cnt
    #define s(x) t[x].sze
}t[500010];
ll n,rt;
ll f[500010],ans1,ans2,pool;
struct node{
    ll num,id;
}a[500010];
inline void upt(const ll &k){s(k)=s(lc(k))+s(rc(k))+c(k);}
inline void Zig(ll &k){
    ll y=lc(k);
    lc(k)=rc(y);
    rc(y)=k;
    s(y)=s(k);
    upt(k);
    k=y;
}
inline void Zag(ll &k){
    ll y=rc(k);
    rc(k)=lc(y);
    lc(y)=k;
    s(y)=s(k);
    upt(k);
    k=y;
}
inline void Insert(ll &k,const ll &key){
    if(!k){
        k=++pool;v(k)=key;p(k)=rand();
        c(k)=s(k)=1;lc(k)=rc(k)=0;
        return ;
    }
    else ++s(k);
    if(v(k)==key) ++c(k);
    else if(key<v(k)){
        Insert(lc(k),key);
        if(p(lc(k))<p(k)) Zig(k);
    }else{
        Insert(rc(k),key);
        if(p(rc(k))<p(k)) Zag(k);
    }
    return ;
}
inline ll QueryRank(const ll &key){
    ll x=rt,res=0;
    while(x){
        if(key==v(x)) return res+s(lc(x))+1;
        if(key<v(x)) x=lc(x);
        else res+=s(lc(x))+c(x),x=rc(x);
    }
}
inline void Delete(ll &k,const ll &key){
    if(v(k)==key){
        if(c(k)>1) --c(k),--s(k);
        else if(!lc(k)||(!rc(k))) k=lc(k)+rc(k);
        else if(p(lc(k))<p(rc(k))) Zig(k),Delete(k,key);
        else Zag(k),Delete(k,key);
        return ;
    }
    --s(k);
    if(key<v(k)) Delete(lc(k),key);
    else Delete(rc(k),key);
    return ;
}//平衡树模板
bool cmp(node qx,node qy){
    return qx.num<qy.num;
}
bool cmp2(node qx,node qy){
    return qx.num>qy.num;
}
int main(){
    freopen("E.in","r",stdin);
    freopen("E.out","w",stdout);
    n=read();
    for(ll i=1;i<=n;i++) a[i].id=i,a[i].num=read();
    sort(a+1,a+n+1,cmp);
    for(ll i=1;i<=n;i++){
//        Insert(a[i].id);
    /*    s.insert(a[i].id);
        s.upper_bound(s.begin(),s.end(),a[i].id);
*///一开始想使用set的，忘记了怎么打
Insert(rt,a[i].id);
ll f1=QueryRank(a[i].id);f1--;
ll f2=i-f1-1;
/*
ll f1=0,f2=0;
for(ll j=1;j<i;j++){
    if(a[j].id<a[i].id) f1++;
    if(a[j].id>a[i].id) f2++;
}
*///暴力写法
ans2+=f1*f2;
    }
    for(ll i=1;i<=n;i++){
        Delete(rt,a[i].id);
    }//记得清除
    sort(a+1,a+n+1,cmp2);
    for(ll i=1;i<=n;i++){
//        Insert(a[i].id);
/*
        s.insert(a[i].id);
        s.upper_bound(s.begin(),s.end(),a[i].id);
*/
Insert(rt,a[i].id);
ll f1=QueryRank(a[i].id);f1--;
ll f2=i-f1-1;
ans1+=f1*f2;
    }
    write(ans1);putchar(‘ ‘);
    write(ans2);putchar(‘\n‘);//输出
    return 0;
}