#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int cmp(const void *const a, const void *const b) {
    return *(int *) a - *(int *) b;
}

int read(int *t, int n) {
    int r = 0;
    while (n) {
        r += t[n];
        n -= (n & -n);
    }
    return r;
}

int update(int *t, int n, int s, int v) {
    while (n < s) {
        t[n] += v;
        n += (n & -n);
    }
}

int main() {
    int n, *a, *b, *c;
    scanf("%d", &n);
    a = malloc(sizeof(int) * n);
    b = malloc(sizeof(int) * n);
    int sz = 1;
    while (sz < n) sz *= 2;
    sz += 1;
    c = malloc(sizeof(int) * sz);
    memset(c, 0, sizeof(int) * sz);
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    memcpy(b, a, sizeof(int) * n);
    qsort(b, n, sizeof(int), cmp);
    for (int i = 0; i < n; i++) a[i] = (int) ((int *) bsearch(&a[i], b, n, sizeof(int), cmp) - b);
    long long r = n;
    for (int i = 0; i < n; i++) {
        update(c, a[i] + 1, sz, 1);
        r += i - read(c, a[i] + 1);
    }
    printf("%lld\n", r);
}
