#include<bits/stdc++.h>

#define fi first

#define se second

#define ll long long

#define ull unsigned long long

#define mp make_pair

#define pb push_back

#define mod 1000000007

#define pii pair<int,int>

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

const int g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f3f;

ll a[N],b[N],sum[N];

void add(int i,ll x)

{

    while(i<N)

    {

        sum[i]+=x;

        i+=i&(-i);

    }

}

ll query(int i)

{

    ll ans=;

    while(i>)

    {

        ans+=sum[i];

        i-=i&(-i);

    }

    return ans;

}

int main()

{

    /*ios::sync_with_stdio(false);

    cin.tie(0);*/

    ll n,cnt=;

    scanf("%lld",&n);

    for(ll i=;i<=n;i++)scanf("%lld",&a[i]),b[cnt++]=a[i];

    sort(b,b+cnt);

    cnt=unique(b,b+cnt)-b;

    for(ll i=;i<=n;i++)a[i]=lower_bound(b,b+n,a[i])-b,a[i]++;

    ll ans[]={},te=1e18;

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

    {

        ans[]+=(ll)(n-i+)*(query(n)-query(a[i]));

        if(ans[]>=te)ans[]+=ans[]/te,ans[]%=te;

        add(a[i],i);

    }

    if(ans[])printf("%lld%018lld\n",ans[],ans[]);

    else printf("%lld\n",ans[]);

    return ;

}

/*******************

3

0 0 0

*******************/