#include <bits/stdc++.h>
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long* X, long long* Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
using namespace std;
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
  out << "[ ";
  for (int i = 0; i < (((int)(v).size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  out << " ]";
  return out;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
  out << "( " << p.first << ", " << p.second << ")";
  return out;
}
template <typename T>
ostream& operator,(ostream& out, T x) {
  out << x << " ";
  return out;
}
int N;
int orig[1000007];
int ara[1000007];
int sum[4 * 1000007];
int query(int idx, int st, int ed, int i, int j) {
  if (st == i && ed == j) {
    return sum[idx];
  }
  int mid = (st + ed) / 2;
  int lft = idx * 2;
  int rgt = lft + 1;
  if (j <= mid) {
    return query(lft, st, mid, i, j);
  } else if (mid < i) {
    return query(rgt, mid + 1, ed, i, j);
  } else {
    return query(lft, st, mid, i, mid) + query(rgt, mid + 1, ed, mid + 1, j);
  }
}
void update(int idx, int st, int ed, int pos) {
  if (st == ed) {
    sum[idx]++;
    return;
  }
  int mid = (st + ed) / 2;
  int lft = idx * 2;
  int rgt = lft + 1;
  if (pos <= mid) {
    update(lft, st, mid, pos);
  } else {
    update(rgt, mid + 1, ed, pos);
  }
  sum[idx] = sum[lft] + sum[rgt];
}
void init() {
  for (int i = 0; i < (N); i++) {
    ara[i] = orig[i];
  }
  unordered_map<int, int> mp;
  sort(ara, ara + N);
  for (int i = 0; i < (N); i++) {
    mp[ara[i]] = i + 1;
  }
  for (int i = 0; i < (N); i++) {
    ara[i] = mp[orig[i]];
  }
}
void solve() {
  unsigned long long cnt = 0;
  int l, r;
  for (int i = 0; i < (N); i++) {
    l = ara[i];
    r = N;
    if (l > r) continue;
    long long bigger = query(1, 1, N, l, r);
    long long smaller = i - bigger;
    smaller = ara[i] - 1 - smaller;
    cnt += (bigger * smaller);
    update(1, 1, N, ara[i]);
  }
  cout << cnt << endl;
}
int main() {
  scanf("%d", &N);
  for (int i = 0; i < (N); i++) {
    scanf("%d", &orig[i]);
  }
  init();
  solve();
  return 0;
}
