#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>

using namespace std;

#define rep(i,a,n) for (int i=a;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define PI 3.14159265358979323846

typedef long long ll;
typedef long double ld;

void fastIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int n;
vector<ll> a;


int main() {
    fastIO();
    cin >> n;
    a.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<ll> pr(n);
    vector<ll> sf(n);
    pr[0] = a[0];
    sf.back() = a.back();
    for (int i = 1; i < n; ++i) {
        pr[i] = min(a[i], pr[i - 1]);
    }
    for (int i = n - 2; i >= 0; --i) {
        sf[i] = min(sf[i], sf[i + 1]);
    }
    int maxi = 0;
    ll ans = -1;
    for (int i = 0; i < n; ++i) {
        ll m = a[i];
        ll x = a[i];
        for (int j = i - 1; j >= 0; --j) {
            m += min(x, a[j]);
            x = min(x, a[j]);
        }
        x = a[i];
        for (int j = i + 1; j < n; ++j) {
            m += min(x, a[j]);
            x = min(x, a[j]);
        }
        if (m > ans) {
            ans = m;
            maxi = i;
        }
    }
    ll ans1 = 0;
    ll ans2 = 0;
    for (int i = 0; i < n; ++i)
        ans1 += pr[i];
    for (int i = 0; i < n; ++i) {
        ans2 += sf[i];
    }
    vector<ll> res(n);
    if (ans > ans1 && ans > ans2) {
        res[maxi] = a[maxi];
        for (int i = maxi - 1; i >= 0; --i) {
            res[i] = min(a[i], res[i + 1]);
        }
        for (int i = maxi + 1; i < n; ++i) {
            res[i] = min(a[i], res[i - 1]);
        }
        rep(i, 0, n) {
            cout << res[i] << " ";
        }
        cout << endl;
        return 0;
    }
    if (ans1 >= ans2) {
        rep(i, 0, n) {
            cout << pr[i] << " ";
        }
        cout << endl;
        return 0;
    }
    else {
        rep(i, 0, n) {
            cout << sf[i] << " ";
        }
        cout << endl;
        return 0;
    }

}