#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;

int n;
int a[MX];
vi b;

int to[MX];
int get(int x) {
  if (to[x] == -1) return x;
  return to[x] = get(to[x]);
}

int main() {
  scanf("%d",&n);
  rep(i,n) scanf("%d",&a[i]);
  b = vi(n);
  vector<P> p;
  rep(i,n) p.pb(P(a[i],i));
  sort(rng(p));
  reverse(rng(p));
  rep(i,n+1) to[i] = -1;
  for (int i = 0; i < n;) {
    int nx = p[i].fi, r = p[i].se;
    while (i < n && p[i].fi == nx) ++i;
    int l = p[i-1].se;
    for (int j = get(l); j <= r;) {
      b[j] = nx;
      if (to[j] == -1) to[j] = j+1;
      j = get(j);
    }
  }
  priv(b);
  return 0;
}