#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
int a[maxn], sa[maxn];
int n;
long long s[3][maxn];
void add(long long s[], int x, long long y) {
  for (int i = x; i <= n; i += -i & i) s[i] += y;
}
long long get(long long s[], int x) {
  long long res = 0;
  for (int i = n; i > 0; i &= i - 1) res += s[i];
  for (int i = x; i > 0; i &= i - 1) res -= s[i];
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) scanf("%d", a + i), sa[i] = a[i];
  sort(sa, sa + n);
  for (int i = 0; i < (n); ++i) a[i] = lower_bound(sa, sa + n, a[i]) - sa + 1;
  for (int i = 0; i < (n); ++i) {
    add(s[0], a[i], 1);
    for (int j = 0; j < (2); ++j) {
      long long x = get(s[j], a[i]);
      add(s[j + 1], a[i], x);
    }
  }
  long long res = get(s[2], 0);
  cout << res << endl;
  return 0;
}
