#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool IN(long long x, long long l, long long r) { return l <= x and x <= r; }
void gg1() {
  write2(-1);
  exit(0);
}
void gg2() {
  puts("NO");
  exit(0);
}
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int M = 5e6 + 10;
long long fac[M], facinv[M], Inv[M];
long long C(int n, int m) {
  return n < 0 or n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
void PRE() {
  fac[0] = 1;
  for (int i = (1), I = (M - 1); i <= I; i++) fac[i] = fac[i - 1] * i % MOD;
  facinv[M - 1] = invm(fac[M - 1]);
  for (int i = (M - 1), I = (1); i >= I; i--)
    facinv[i - 1] = facinv[i] * i % MOD;
  Inv[1] = 1;
  for (int i = (2), I = (M - 1); i <= I; i++)
    Inv[i] = (MOD - MOD / i) * Inv[MOD % i] % MOD;
}
const int N = 1e6 + 10;
int m[N], tt[N], a[N];
void main() {
  PRE();
  int n = qread();
  for (int i = (1), I = (n); i <= I; i++) m[i] = qread();
  long long ans = 0;
  for (int mx = (1), I = (n); mx <= I; mx++) {
    long long sum = m[mx];
    bool gg = 0;
    a[mx] = sum;
    for (int now = m[mx], i = mx - 1; i >= 1; i--)
      now = min(m[i], now), gg |= (now < 1), sum += now, a[i] = now;
    for (int now = m[mx], i = mx + 1; i <= n; i++)
      now = min(m[i], now), gg |= (now < 1), sum += now, a[i] = now;
    if (!gg and sum > ans) ans = sum, memcpy(tt, a, sizeof a);
    if (0) printf("mx=%d sum=%lld gg=%d\n", mx, sum, gg);
  }
  for (int i = (1), I = (n); i <= I; i++) write1(tt[i]);
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::main();
  if (0)
    cerr << "\n---------------------Zory---------------------nTime: "
         << 1.0 * clock() / CLOCKS_PER_SEC << "s";
}
