#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;
using ll = long long;

ll calcDistanceSum(const vector<int>& A_pos, const vector<int>& B_pos) {
    // Giả sử A_pos và B_pos đã tăng dần
    ll res = 0;
    int n = B_pos.size();
    vector<ll> prefix(n + 1, 0);
    for (int i = 0; i < n; ++i)
        prefix[i + 1] = prefix[i] + B_pos[i];

    for (int x : A_pos) {
        int l = lower_bound(B_pos.begin(), B_pos.end(), x) - B_pos.begin();
        int r = n - l;

        ll left_sum = 1LL * l * x - prefix[l];
        ll right_sum = (prefix[n] - prefix[l]) - 1LL * r * x;
        res += left_sum + right_sum;
    }
    return res;
}

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    map<int, vector<int>> value_to_indices;

    for (int i = 0; i < N; ++i) {
        cin >> A[i];
        value_to_indices[A[i]].push_back(i);
    }

    ll result = 0;
    for (auto it1 = value_to_indices.begin(); it1 != value_to_indices.end(); ++it1) {
        for (auto it2 = next(it1); it2 != value_to_indices.end(); ++it2) {
            int v1 = it1->first, v2 = it2->first;
            ll diff = abs(v1 - v2);
            ll sum = calcDistanceSum(it1->second, it2->second);
            result += 2LL * diff * sum; // nhân đôi do chỉ xét i < j
        }
    }

    cout << result << endl;
    return 0;
}