#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
  if (b >= (MOD - 1)) b %= (MOD - 1);
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long mpow(long long a, long long b, long long p) {
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2, p);
  t1 *= t1;
  t1 %= p;
  if (b % 2) t1 *= a;
  t1 %= p;
  return t1;
}
long long modinverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
void solve() {
  long long n;
  cin >> n;
  vector<long long> m(n);
  for (long long i = 0; i < n; i++) cin >> m[i];
  long long ans1 = 0;
  vector<long long> out(n, 0);
  for (long long k = 0; k < n; k++) {
    long long temp = 0;
    long long maxm = 1e18;
    vector<long long> ans(n, 0);
    for (int i = k; i < n; i++) {
      maxm = min(maxm, m[i]);
      temp += maxm;
      ans[i] = maxm;
    }
    maxm = 1e18;
    for (long long i = k; i >= 0; i--) {
      maxm = min(maxm, m[i]);
      temp += maxm;
      ans[i] = maxm;
    }
    temp -= ans[k];
    if (ans1 < temp) {
      out = ans;
      ans1 = temp;
    }
  }
  for (long long i = 0; i < n; i++) {
    cout << out[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
