#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 30000 + 10;
int n, p, a[N];
unsigned long long int l[N], g[N], s;
int main() {
    freopen("three.in", "r", stdin);
    freopen("three.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
        scanf("%d", a+i);
    /*for(int i=1; i<=n; i++) {
        for(int j=1; j<i; j++)
            l[i] += a[j] < a[i];
        for(int j=i+1; j<=n; j++)
            g[i] += a[j] > a[i];
        fprintf(stderr, "%d %d\n", l[i], g[i]);
        s += l[i] * g[i];
    } */
    for(int i=1; i<=n; i++) {
        for(int j=i-1; j>=1; j--) if(a[j] < a[i])
            l[i]++, g[i] += l[j];
        s += g[i];
    }
    printf("%lld\n", s);
    return 0;
}