#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
template <class T>
void dispvector(vector<T> v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
template <class T>
void disparray(T *v, int n) {
  for (int i = 0; i < n; i++) cout << v[i] << " ";
  cout << "\n";
}
template <class T>
int sizeofarr(T *v) {
  return sizeof(v) / sizeof(T);
}
signed main(int argc, char **argv) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> arr(n);
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  long long int ans = 0;
  vector<long long int> fans;
  for (long long int i = 0; i < n; i++) {
    long long int sum = arr[i];
    long long int prev1 = arr[i];
    vector<long long int> lans = arr;
    for (long long int j = i + 1; j < n; j++) {
      prev1 = min(prev1, arr[j]);
      lans[j] = prev1;
      sum += prev1;
    }
    long long int prev2 = arr[i];
    for (long long int j = i - 1; j >= 0; j--) {
      prev2 = min(prev2, arr[j]);
      lans[j] = prev2;
      sum += prev2;
    }
    if (sum > ans) {
      ans = sum;
      fans = lans;
    }
  }
  dispvector(fans);
  return 0;
}
