#include "bits/stdc++.h"

using ll = long long;
using namespace std;

random_device rd;
mt19937_64 rnd(228);

// int RND() {
//     return rand() << 15 | rand();
// }

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

    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    auto cost = [&]() -> int {
        vector<int> left(n, -1);
        vector<int> right(n, -1);

        vector<int> Q;

        for (int i = 0; i < n; i++) {
            while (!Q.empty() && a[Q.back()] <= a[i]) {
                Q.pop_back();
            }

            if (!Q.empty()) {
                left[i] = Q.back();
            }

            Q.push_back(i);
        }

        Q.clear();

        for (int i = n - 1; i >= 0; i--) {
            while (!Q.empty() && a[Q.back()] < a[i]) {
                Q.pop_back();
            }

            if (!Q.empty()) {
                right[i] = Q.back();
            }

            Q.push_back(i);
        }

        int sum = 0;

        for (int i = 0; i < n; i++) {
            if (left[i] != -1 && right[i] != -1 && a[right[i]] != a[i]) {
                sum += (right[i] - left[i] - 1) * (min(a[right[i]], a[left[i]]) - a[i]);
            }
        }

        return sum;
    };

    set<int> Q;

    sort(a.begin(), a.end());

    do {
        Q.insert(cost());
    } while (1.l * clock() / CLOCKS_PER_SEC < 0.3l && next_permutation(a.begin(), a.end()));

    while (1.l * clock() / CLOCKS_PER_SEC < 0.99l) {
        shuffle(a.begin(), a.end(), rnd);
        Q.insert(cost());
    }

    for (int x : Q) {
        cout << x << " ";
    }
    cout << "\n";
    return 0;
}