#include<stdio.h>
long long int seg[800005], ss;
void update(long long int x, long long int d)
{
    x += ss - 1;
    seg[x] += d;
    while (x > 0)
    {
        x = (x - 1) / 2;
        seg[x] = seg[2 * x + 1] + seg[2 * x + 2];
    }
    return;
}
long long int get(long long int l, long long int r)
{
    l += ss - 1;
    r += ss - 1;
    long long int res = 0;
    for (; l <= r; l /= 2, r = r / 2 - 1)
    {
        if (l % 2 == 0)
            res += seg[l];
        if (r % 2 > 0)
            res += seg[r];
    }
    return res;
}
long long int h[200005], l;
int comp_h(long long int a, long long int b)
{
    if (h[a] > h[b])
        return 1;
    else
        return -1;
}
void swap_h(long long int a, long long int b)
{
    long long int f = h[a];
    h[a] = h[b];
    h[b] = f;
    return;
}
void push(long long int ne)
{
    h[l] = ne;
    long long int p = l++;
    for (; p > 0; p = (p - 1) / 2)
        if (comp_h((p - 1) / 2, p) > 0)
            swap_h((p - 1) / 2, p);
    return;
}
long long int pop()
{
    swap_h(0, --l);
    long long int p = 0;
    for (;;)
    {
        if (2 * p + 2 < l)
        {
            if (comp_h(2 * p + 1, 2 * p + 2) > 0)
            {
                if (comp_h(p, 2 * p + 2) > 0)
                    swap_h(p, 2 * p + 2);
                p = 2 * p + 2;
            }
            else
            {
                if (comp_h(p, 2 * p + 1) > 0)
                    swap_h(p, 2 * p + 1);
                p = 2 * p + 1;
            }
        }
        else if (2 * p + 1 < l)
        {
            if (comp_h(p, 2 * p + 1) > 0)
                swap_h(p, 2 * p + 1);
            p = 2 * p + 1;
        }
        else
            break;
    }
    return h[l];
}
long long int sorted[200005];
long long int n;
long long int find(long long int v)
{
    long long int min, mid, max;
    min = -1;
    max = n;
    while (max - min > 1)
    {
        mid = (max + min) / 2;
        if (sorted[mid] < v)
            min = mid;
        else
            max = mid;
    }
    return max;
}
long long int a[200005];
int main()
{
    scanf("%lld", &n);
    long long int i;
    for (i = 0; i < n; i++)
        scanf("%lld", &a[i]);
    l = 0;
    for (i = 0; i < n; i++)
        push(a[i]);
    for (i = 0; i < n; i++)
        sorted[i] = pop();
    for (i = 0; i < n; i++)
        a[i] = find(a[i]);
    long long int ans = 0;
    for (ss = 1; ss < n; ss *= 2);
    for (i = 0; i < 2 * ss - 1; i++)
        seg[i] = 0;
    for (i = 0; i < n; i++)
    {
        ans += get(a[i] + 1, n - 1);
        update(a[i], 1);
    }
    printf("%lld\n", ans);
    return 0;
}