#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 62;
const int mods = 998244353;
const int MAXN = 600005;
const int INF = 0x3f3f3f3f;
inline int read() {
  int f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
int a[MAXN], dp1[MAXN], dp2[MAXN], ans[MAXN];
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) a[i] = read(), upmax(ans[1], a[i]);
  for (int i = 1; i < n; i++) upmax(dp1[min(i, n - i)], max(a[i], a[i + 1]));
  for (int i = 2; i < n; i++)
    upmax(dp2[min(i - 1, n - i)],
          max(min(a[i - 1], a[i]), min(a[i], a[i + 1])));
  for (int i = n / 2; i >= 1; i--)
    ans[i << 1] = max(ans[(i + 1) << 1], dp1[i]),
             ans[i << 1 | 1] = max(ans[(i + 1) << 1 | 1], dp2[i]);
  for (int i = n; i >= 1; i--) printf("%d ", ans[i]);
  return 0;
}
