#include <fstream>
#include <algorithm>
#define DEF 2001

using namespace std;

ifstream fin ("psir.in");
ofstream fout ("psir.out");

unsigned int n, d[DEF][DEF], u[DEF], crt, s;

pair < unsigned int, int > v[DEF];

int main () {
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> v[i].first;
        v[i].second = i;
    }

    sort (v + 1, v + n + 1);

    for (int i = 1; i <= n; i++) {
        if (v[i].first != v[i - 1].first) {
            u[v[i].second] = ++crt;
        }
        else {
            u[v[i].second] = crt;
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j < i; j++) {
            ++d[i][u[j]];
            if (u[i] > u[j]) {
                d[i][u[j]] += d[j][n] - d[j][u[i]];
            }
            if (u[i] < u[j]) {
                d[i][u[j]] += d[j][u[i] - 1];
            }
        }
        for (int j = 1; j <= n; j++) {
            d[i][j] += d[i][j - 1];
        }
    }
        /*
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            fout << d[i][j] << " ";
        }
        fout << "\n";
    }
    fout << "\n";
    for (int i = 1; i <= n; i++)
        fout << u[i] << " ";
        */

    for (int j = 1; j <= n; j++) {
        s += d[j][n];
    }

    fout << s;

    return 0;
}