/**
 * @author: XiaFan
 * @date: 2023-03-08 14:01
 **/
#include <bits/stdc++.h>
using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;
    std::vector<i64> a(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    std::vector<int> b(n);
    std::iota(b.begin(), b.end(), 0);
    std::sort(b.begin(), b.end(), [&](int x, int y) {
        return a[x] < a[y];
    });
    std::vector<bool> vis(n);
    std::vector<i64> ssum(n);
    i64 ans = 0, sum = 0;
    int lastid = -1;
    for (int i = n - 1, j = 0; i >= 0; i--) {
        if (vis[i]) {
            continue;
        }
        vis[i] = true;
        
        for (; j < n; j++) {
            int id = b[j];
            if (a[id] > a[i]) {
                break;
            } else {
                sum += a[id];
                vis[id] = true;
            }
        }

        if (lastid != -1) {
            sum -= a[lastid];
        }
        if (j < n) {
            sum += a[i];
        }
        ssum[i] = sum;
        if (lastid == -1) {
            ans += 1LL * (i + 1) * ssum[i];
        } else {
            ans += 1LL * (i + 1) * (ssum[i] - ssum[lastid]);
        }
        lastid = i;
    }
    
    // for (auto i : ssum) {
    //     std::cerr << i << " ";
    // }
    std::cout << ans << "\n";

    return 0;
}