#include <bits/stdc++.h>
using namespace std;
template <class T, class first>
inline bool checkbit(T a, first pos) {
  T t = 1;
  return ((a & (t << pos)) > 0);
}
template <class T, class first>
inline T setbit(T a, first pos) {
  T t = 1;
  return (a | (t << pos));
}
template <class T, class first>
inline T resetbit(T a, first pos) {
  T t = 1;
  return (a & (~(t << pos)));
}
template <class T, class first>
inline T togglebit(T a, first pos) {
  T t = 1;
  return (a ^ (t << pos));
}
template <typename T>
T POW(T B, T printf) {
  if (printf == 0) return 1;
  if (printf & 1)
    return B * POW(B, printf - 1);
  else
    return (POW(B, printf / 2) * POW(B, printf / 2));
}
template <typename T>
T Bigmod(T base, T power, T mod) {
  T ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % mod;
    base = (base * base) % mod;
    power >>= 1;
  }
  return ret;
}
template <typename T>
T ModInverse(T number, T mod) {
  return Bigmod(number, mod - 2, mod);
}
template <typename T>
T GCD(T a, T b) {
  if (a < 0) return GCD(-a, b);
  if (b < 0) return GCD(a, -b);
  return (b == 0) ? a : GCD(b, a % b);
}
template <typename T>
T LCM(T a, T b) {
  if (a < 0) return LCM(-a, b);
  if (b < 0) return LCM(a, -b);
  return a * (b / GCD(a, b));
}
template <typename T>
T EUCLIDE(T a, T b, T &x, T &y) {
  if (a < 0) {
    T d = euclide(-a, b, x, y);
    x = -x;
    return d;
  }
  if (b < 0) {
    T d = euclide(a, -b, x, y);
    y = -y;
    return d;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    T d = euclide(b, a % b, x, y);
    T t = x;
    x = y;
    y = t - (a / b) * y;
    return d;
  }
}
template <typename T>
T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
double DEG(double x) { return (180.0 * x) / ((2.0 * acos(0.0))); }
double RAD(double x) { return (x * (double)(2.0 * acos(0.0))) / (180.0); }
template <typename T>
T DIS(T x1, T y1, T x2, T y2) {
  return sqrt((double)((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
}
template <typename T>
T ANGLE(T x1, T y1, T x2, T y2) {
  return atan(double(y1 - y2) / double(x1 - x2));
}
template <typename T>
long long isLeft(T a, T b, T c) {
  return (c.x - a.x) * (b.y - a.y) - (b.x - a.x) * (c.y - a.y);
}
template <class T>
inline bool setmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T>
inline bool setmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
void P_ARR(int *ar, int a, int b) {
  if (a > b) swap(a, b);
  if (a <= b) cout << ar[a];
  for (int i = a + 1; i <= b; i++) cout << " " << ar[i];
  cout << endl;
}
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
int height[200007];
int dp[200007][21];
int n;
void sparse_table() {
  for (int i = 0; i < n; i++) dp[i][0] = i;
  for (int j = 1; (1 << j) <= n; j++)
    for (int i = 0; i + (1 << j) - 1 < n; i++)
      dp[i][j] = (height[dp[i][j - 1]] <= height[dp[i + (1 << (j - 1))][j - 1]])
                     ? dp[i][j] = dp[i][j - 1]
                     : dp[i + (1 << (j - 1))][j - 1];
}
int find(int start, int end) {
  if (start > end) swap(start, end);
  int diff = end - start;
  diff = 31 - __builtin_clz(diff + 1);
  return height[dp[start][diff]] <= height[dp[end - (1 << diff) + 1][diff]]
             ? height[dp[start][diff]]
             : height[dp[end - (1 << diff) + 1][diff]];
}
int tree[4 * 200007];
void update(int idx, int s, int e, int x, int y, int v) {
  if (s == x && e == y) {
    tree[idx] = max(tree[idx], v);
    return;
  }
  int mid = (s + e) >> 1, l = (idx << 1), r = (l | 1);
  if (tree[idx]) {
    tree[l] = max(tree[l], tree[idx]);
    tree[r] = max(tree[r], tree[idx]);
    tree[idx] = 0;
  }
  if (y <= mid)
    update(l, s, mid, x, y, v);
  else if (x > mid)
    update(r, mid + 1, e, x, y, v);
  else {
    update(l, s, mid, x, mid, v);
    update(r, mid + 1, e, mid + 1, y, v);
  }
}
int res[200007];
void query(int idx, int s, int e, int mx) {
  if (s == e) {
    res[s] = max(tree[idx], mx);
    return;
  }
  int mid = (s + e) >> 1, l = (idx << 1), r = (l | 1);
  query(l, s, mid, max(mx, tree[idx]));
  query(r, mid + 1, e, max(mx, tree[idx]));
}
int lt[200007], rt[200007];
void solve(int *ar) {
  stack<int> s;
  ar[0] = ar[n + 1] = INT_MIN;
  s.push(0);
  for (int i = 1; i <= n; i++) {
    while (!s.empty() && ar[s.top()] >= ar[i]) s.pop();
    lt[i] = i - s.top();
    s.push(i);
  }
  while (!s.empty()) s.pop();
  s.push(n + 1);
  for (int i = n; i > 0; i--) {
    while (!s.empty() && ar[s.top()] >= ar[i]) s.pop();
    rt[i] = s.top() - i;
    s.push(i);
  }
}
int mx[200007];
int main() {
  scanf("%d", &(n));
  for (int i = 1; i <= n; i++) scanf("%d", &(height[i]));
  solve(height);
  for (int i = 1; i <= n; i++) {
    int l = (rt[i] + lt[i] - 1);
    mx[l] = max(mx[l], height[i]);
  }
  for (int i = n; i >= 1; i--) mx[i] = max(mx[i], mx[i + 1]);
  for (int i = 1; i <= n; i++) {
    printf("%d ", mx[i]);
  }
  puts("");
  ;
  return 0;
}
