#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<ll> ft;
void add(ll i, ll d) {
  for (; i <= n; i += i & -i) ft[i] += d;
}
ll sum(ll i) {
  if (i == 0) return 0;
  return sum(i ^ (i & -i)) + ft[i];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  vector<int> a(n + 1);
  vector<int> b(n + 1);
  ft.assign(n + 1, 0);
  vector<pair<int, int>> asd(n + 1, make_pair(0, 0));
  for (int i = 1; i < n + 1; i++) {
    cin >> asd[i].first;
    asd[i].second = i;
  }
  sort(asd.begin(), asd.end());
  vector<int> dsa(n + 1);
  int j = 1;
  dsa[1] = asd[1].first = 1;
  for (int i = 2; i < n + 1; i++) {
    if (asd[i - 1].first != asd[i].first) j++;
    dsa[i] = j;
  }
  for (int i = 1; i < n + 1; i++) {
    a[asd[i].second] = dsa[i];
  }
  for (int i = 1; i < n + 1; i++) {
    b[i] = i - sum(a[i]) - 1;
    add(a[i], 1);
  }
  ft.assign(n + 1, 0);
  ll s = 0;
  for (int i = 1; i < n + 1; i++) {
    add(a[i], b[i]);
    s += sum(n) - sum(a[i]);
  }
  cout << s << endl;
  return 0;
}
