#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const ll INF = (1LL<<15);

template <typename T> struct LazySegmentTree {
  
  int n;
  vector<T> node, lazy;

  T f(T a, T b) {return (a + b);}

  LazySegmentTree (int sz, T init = 0) {
    n = 1; while (n < sz) n <<= 1;
    node.assign(2*n, init);
    lazy.assign(2*n,-1); 
  }

  void eval (int k) {
    if (lazy[k] == -1) return ;
    node[k] = lazy[k];
    if (k < n) {
      lazy[2*k+1] = lazy[k];
      lazy[2*k+2] = lazy[k];
    }
    lazy[k] = -1;
  }

  void update(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
    eval(k);
    if (r < 0) r = n;
    if (b <= l || r <= a) return ;
    if (a <= l && r <= b) {
      lazy[k] = x;
      eval(k);
    } else {
      update(a, b, x, 2*k+1, l, (r+l)/2);
      update(a, b, x, 2*k+2, (r+l)/2, r);
      node[k] = f(node[2*k+1], node[2*k+2]);
    }
  }

  T query(int a, int b, int k = 0, int l = 0, int r = -1) {
    eval(k);
    if (r < 0) r = n;
    if (r <= a || b <= l) return 0;
    if (a <= l && r <= b) return node[k];
    T vl = query(a, b, 2*k+1, l, (l+r)/2);
    T vr = query(a, b, 2*k+2, (l+r)/2, r);
    return f(vl, vr);
  }

  T getvalue(int k) {
    return query(k,k+1);
  }

};

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i,n) cin >> a[i];

  map<int,P> mp;
  for (int i = 0; i < n; i++) {
    if (!mp.count(a[i])) mp[a[i]] = {i,i+1};
    else {
      mp[a[i]].first = min(i, mp[a[i]].first);
      mp[a[i]].second = max(i+1, mp[a[i]].second);
    }
  }
  LazySegmentTree<int> sg(n,0);
  for (auto e : mp) {
    sg.update(e.second.first, e.second.second, e.first);
  }
  for (int i = 0; i < n; i++) cout << sg.getvalue(i) << " ";
  cout << endl;
  return 0;
}