#include <bits/stdc++.h>
using namespace std;
int n;
long long BIT[1000010];
void update(int x, int val) {
  while (x <= n) {
    BIT[x] += val;
    x += (x & -x);
  }
}
long long sum(int x) {
  long long res = 0;
  while (x) {
    res += BIT[x];
    x -= (x & -x);
  }
  return res;
}
int main() {
  scanf("%d", &n);
  int a[n];
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int b[n];
  for (int i = 0; i < n; i++) b[i] = a[i];
  sort(b, b + n);
  for (int i = 0; i < n; i++) a[i] = 1 + (lower_bound(b, b + n, a[i]) - b);
  long long inv = 0;
  long long prev[n];
  long long next[n];
  for (int i = n - 1; i >= 0; i--) {
    update(a[i], 1);
    prev[i] = sum(a[i] - 1);
  }
  memset(BIT, 0, (n + 1) * sizeof(long long));
  for (int i = 0; i < n; i++) {
    update(a[i], 1);
    next[i] = sum(n) - sum(a[i]);
  }
  for (int i = 1; i < n - 1; i++) inv += prev[i] * next[i];
  cout << inv << endl;
  return 0;
}
