#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

// 8
// 1 2 1 3 2 0 1 0



vector<int> a;

int consistency(int n){
	
	vector<int> pSmaller(n);
	for(int j=1; j<=n-1; j++){
		for(int i=j-1; i>=0; i--){
			if(a[i] < a[j]) pSmaller[j]++;
		}
	}
	
	vector<int> sSmaller(n);
	for(int j=n-2; j>=0; j--){
		for(int i=j+1; i<n; i++){
			if(a[i] < a[j]) sSmaller[j]++;
		}
	}
	
	int ans = 0;
	
	for(int j=2; j<=n-3; j++){
		
		int left = 0;
		for(int i=j-1; i>=1; i--){
			if(a[i] > a[j]) left += pSmaller[i];	
		}
		
		int right = 0;
		for(int k=j+1; k<=n-2; k++){
			if(a[k] > a[j]) right += sSmaller[k];
		}
		
		ans += left*right;
	}

	return ans;
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}