#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 100005
ll a[maxn];
ll i, j, k, n, m, res, sum;
map<ll, vector<ll>> mapping;
ll solve(vector<ll> u)
{
    sort(u.begin(), u.end());
    ll pre_sum[u.size()];
    memset(pre_sum, 0, sizeof(pre_sum));
    pre_sum[0] = u[0];
    for (ll i = 1; i < u.size(); i++)
        pre_sum[i] = pre_sum[i - 1] + u[i];
    ll tong = 0;
    for (ll n = u.size() - 1; n >= 1; n--)
    {
        tong = tong + n * u[n] - pre_sum[n - 1];
    }
    return tong;
}
int main()
{
    cin >> n;
    for (i = 0; i < n; i++)
    {
        ll x;
        cin >> x;
        mapping[x].push_back(i);
    }
    for (auto p : mapping)
    {
        if (p.second.size() >= 2)
        {
            res = res + solve(p.second);
        }
    }
    cout << res;
    return 0;
}