#742. 喵喵序列

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);
inline ll ksc(ll x,ll y,ll mod)
{
    ll ans = 0;
    while (y) {
        if (y & 1)
            ans = (ans + x) %mod;
        y >>= 1;
        x = (x + x) %mod;
    }
    return ans;
}
inline ll qmi (ll a, ll b) {
    ll ans = 1;
    while (b) {
        if (b & 1) ans = ans * a;
        a = a * a;
        b >>= 1;
    }
    return ans;
}
inline int read () {
    int x = 0, f = 0;
    char ch = getchar();
    while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
    while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
    return f?-x:x;
}
template<typename T> void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x >= 10) print(x/10);
    putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
    return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
    return (a + b) %mod;
}
// inline ll inv (ll a) {
    // return qmi(a, mod - 2);
// }
#define int long long
const int N = 3e5 + 10;
int n;
ll a[N];
int s[N];
int m;
void add1 (int x, int num) {
    for (;x <= m; x += x &-x)
        s[x] += num;
}
ll query (int x) {
    ll ans = 0;
    for (;x; x -= x & -x)
        ans += s[x];
    
    return ans;
}
vector<int> alls;
int l[N], r[N];

void solve() {
    cin >> n;
    for (int i = 1; i<= n; i++)  {
        cin >> a[i];
        alls.pb(a[i]);
    }   
    sort(all(alls));
    alls.erase(unique(all(alls)), alls.end());
    for (int i =  1; i <= n; i ++) {
        a[i] = lower_bound(all(alls), a[i]) - alls.begin();
        a[i] ++;
    }

    
    m = alls.size();
    for (int i = 1; i <= n; i ++)
    {
        l[i] = query(a[i] - 1);
        add1 (a[i], 1);
    }
    memset(s, 0, sizeof s);
    
    for (int i = n; i >= 1; i --) {
        r[i] = query(m) - query(a[i]);
        add1 (a[i], 1);
    }
    int ans = 0;
    for (int i = 1; i<= n; i ++)
        ans += l[i] * r[i];
    cout << ans << endl;
}
signed main () {
    // ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}