#include <stdio.h>

void add_segt (int *t, int idx, int val, int size) {
  idx = idx+size-1;
  t[idx] += val;
  
  while (idx > 0) {
    idx = (idx-1)/2;
    t[idx] += val;
  }
  
  return;
}

int sum_segt_rec (int *t, int a, int b, int k, int l, int r) {
  int ans = 0;
  
  if (r <= a || b <= l) {
    return 0;
  }
  
  if (a <= l && r <= b) {
    return t[k];
  }
  
  ans = sum_segt_rec(t, a, b, 2*k+1, l, (l+r)/2);
  ans += sum_segt_rec(t, a, b, 2*k+2, (l+r)/2, r);
  
  return ans;
}

int sum_segt (int *t, int a, int b, int size) {
  return sum_segt_rec(t, a, b, 0, 0, size);
}

int main () {
  int n = 0;
  int p = 0;
  
  int res = 0;
  
  long long ans = 0LL;
  long long mod_num = 998244353LL;
  
  int t[1048575] = {};
  int size = 1;
  
  long long fact[300001] = {};
  long long invf[300001] = {};
  
  res = scanf("%d", &n);
  while (size <= n) {
    size <<= 1;
  }
  for (int i = 0; i < n; i++) {
    res = scanf("%d", &p);
    p--;
    add_segt(t, p, 1, size);
  }
  
  printf("%lld\n", ans);
  return 0;
}