#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> ostream &operator << (ostream &os, const vector<T> &);
template<size_t n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, const tuple<T...> &){}
template<size_t n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream &os, const tuple<T...> &t){
    os << (n == 0 ? "" : " ") << get<n>(t); _ot<n+1>(os, t);
}
template<class...T> ostream &operator << (ostream &os, const tuple<T...> &t){
    _ot<0>(os, t); return os;
}
template<class T, class U> ostream & operator << (ostream &os, const pair<T,U> &p){
    return os << "(" << p.first << ", " << p.second << ") ";
}
template<class T> ostream &operator << (ostream &os, const vector<T> &v){
    for(size_t i = 0; i < v.size(); i++) os << v[i] << (i + 1 == v.size() ? "" : ", "); return os;
}
#ifdef DEBUG
#define dump(...) (cerr << #__VA_ARGS__ << " = " << make_tuple(__VA_ARGS__) \
                   << " (L : " << __LINE__ << ")" << endl)
#else
#define dump(...)
#endif
#define all(c) begin(c), end(c)
#define range(i,a,b) for(int i = a; i < (int)(b); i++)
#define rep(i,b) range(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
using ll = long long;
// #define int ll
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
void fastios(){ ios_base::sync_with_stdio(0); cin.tie(0); }
int const mod = 1000000007;
auto const inf = numeric_limits<int>::max()/8;

int n;
vi in;

vi solve(){
    const int B = 300;
    vi a(n,-1), b(n/B+1,-1);
    map<int,int> maxPos, minPos;
    rep(i,n){
        if(maxPos.count(in[i])){
            maxPos[in[i]] = max(maxPos[in[i]], i);
            minPos[in[i]] = min(minPos[in[i]], i);
        } else {
            maxPos[in[i]] = minPos[in[i]] = i;
        }
    }
    auto assign = [&](int l, int r, int x){
        int i = l;
        while(i < r){
            if(i%B == 0 && i + B <= r){
                b[i/B] = x;
                i += B;
            } else {
                a[i] = x;
                i++;
            }
        }
    };
    auto get = [&](int i){
        return max(a[i], b[i/B]);
    };
    for(auto & p : minPos){
        int v = p.first, l = p.second, r = maxPos[v]+1;
        dump(l,r,v);
        assign(l,r,v);
    }
    vector<int> res(n);
    rep(i,n) res[i] = get(i);
    return res;
}

int main(){
    while(cin >> n){
        in.resize(n);
        rep(i,n) cin >> in[i];
        vi ans = solve();
        rep(i,ans.size()) cout << ans[i] << (i+1==(int)ans.size() ? '\n' : ' ');
    }
}