#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) {
    long long int n = 0, m = 0, k = 0, i = 0, j = 0, p = 0, q = 0, x = 0, y = 0,
                  z = 0, cnt = 0, l = 0, r = 0, mid = 0, lo = 0, hi = 0;
    string s;
    bool flag = false;
    cin >> n;
    long long int a[n];
    for (i = 0; i <= n - 1; i++) cin >> a[i];
    long long int dpl[n];
    long long int dpr[n];
    pair<long long int, long long int> pr;
    stack<pair<long long int, long long int>> st;
    st.push(make_pair(a[0], 0));
    for (i = 1; i < n; i++) {
      while (!st.empty() && (st.top()).first > a[i]) {
        pr = st.top();
        st.pop();
        dpr[pr.second] = i;
      }
      st.push(make_pair(a[i], i));
    }
    while (!st.empty()) {
      pr = st.top();
      st.pop();
      dpr[pr.second] = n;
    }
    st.push(make_pair(a[n - 1], n - 1));
    for (i = n - 2; i >= 0; i--) {
      while (!st.empty() && (st.top()).first > a[i]) {
        pr = st.top();
        st.pop();
        dpl[pr.second] = i;
      }
      st.push(make_pair(a[i], i));
    }
    while (!st.empty()) {
      pr = st.top();
      st.pop();
      dpl[pr.second] = -1;
    }
    long long int ans[n + 1];
    vector<pair<long long int, long long int>> vec;
    for (i = 0; i < n; i++) vec.push_back(make_pair(a[i], i));
    sort(vec.rbegin(), vec.rend());
    j = 1;
    for (i = 0; i < n; i++) {
      pr = vec[i];
      z = 0;
      z = pr.second - dpl[pr.second] - 1;
      z += dpr[pr.second] - pr.second - 1;
      z++;
      while (j <= z) ans[j] = pr.first, j++;
    }
    for (i = 1; i <= n; i++) cout << ans[i] << " ";
    cout << endl;
  }
  return 0;
}
