#include <bits/stdc++.h>
using namespace std;
const long long int Maxn3 = 1e3 + 10;
const long long int Maxn4 = 1e4 + 10;
const long long int Maxn5 = 1e5 + 10;
const long long int Maxn6 = 1e6 + 10;
const long long int Maxn7 = 1e7 + 10;
const long long int Maxn8 = 1e8 + 10;
const long long int Maxn9 = 1e9 + 10;
const long long int Maxn18 = 1e18 + 10;
const long long int Mod1 = 1e7 + 7;
const long long int Mod2 = 1e9 + 7;
const long long int LLMax = LLONG_MAX;
const long long int LLMin = LLONG_MIN;
const long long int INTMax = INT_MAX;
const long long int INTMin = INT_MIN;
long long int mn = LLMax, mx = LLMin;
stack<long long int> st;
pair<long long int, long long int> a[Maxn6];
long long int b[Maxn6], ans[Maxn6];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n; i++) cin >> b[i];
  for (long long int i = 0; i < n; i++) {
    while (!st.empty() and b[i] <= b[st.top()]) {
      a[i].first += a[st.top()].first + 1;
      st.pop();
    }
    st.push(i);
  }
  while (!st.empty()) st.pop();
  for (long long int i = n - 1; i >= 0; i--) {
    while (!st.empty() and b[i] <= b[st.top()]) {
      a[i].second += a[st.top()].second + 1;
      st.pop();
    }
    st.push(i);
  }
  for (long long int i = 0; i < n; i++)
    ((ans[a[i].first + a[i].second + 1]) =
         max((ans[a[i].first + a[i].second + 1]), (b[i])));
  for (long long int i = n - 1; i >= 1; i--)
    ((ans[i]) = max((ans[i]), (ans[i + 1])));
  for (long long int i = 1; i <= n; i++) cout << ans[i] << ' ';
  return 0;
}
