#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,O3,unroll-loops")
using namespace std;
#ifdef CM
#include "debug.h"
#else
#define debug(...) 42
#endif
#define pb emplace_back
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define aura 1e18
#define pii pair<int,int>
#define uni(v) v.resize(unique(ALL(v))-v.begin())
void die(string S){puts(S.c_str());return;}
#define int long long
const int mod=1e9+7;
int binpow(int a,int b)
{
int res=1;
while(b)
{
if(b&1)
res=res*a%mod;
b>>=1;
a=a*a%mod;
}
return res%mod;
}
int inv(int x)
{
return binpow(x,mod-2)%mod;
}
vector<int>fac(1e6+1);
struct FenwickTree
{
vector<int>tree;
int n;
FenwickTree(int n)
{
this->n=n;
tree.assign(n+5,0);
};
void add(int i,int delta)
{
for(++i;i<=n;i+=i&-i)
tree[i]+=delta;
}
int pref(int i)
{
int ans=0;
for(++i;i>0;i-=i&-i)
ans+=tree[i];
return ans;
}
int get(int l,int r)
{
return pref(r)-pref(l-1);
}
};
int C(int a,int b)
{
return fac[a]*inv(fac[a-b]*fac[b]%mod)%mod;
}
void solve()
{
int n;
cin>>n;
vector<int>a(n);
for(int &x:a)
cin>>x;
vector<int>b=a;
srt(b);
for(int &x:a)
x=lower_bound(ALL(b),x)-b.begin()+1;
FenwickTree ft1(n+1),ft2(n+1);
for(int i=0;i<n;i++)
ft2.add(a[i],1);
int ans=0;
for(int x:a)
{
ft1.add(x,1);
ft2.add(x,-1);
int cnt=ft1.pref(x-1),cnt2=ft2.pref(x-1);
ans+=cnt*cnt2;
}
cout<<ans;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
#ifdef CM
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
fac[1]=1;
for(int i=2;i<=1e6;++i)
fac[i]=fac[i-1]*i%mod;
// cin>>t;
while(t--)
solve();
return 0;
}
