#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <map>
using namespace std;

int n;
int b[100005];
unordered_map<int, pair<int, int>> dic;

int main(void) {
  int n; scanf("%d", &n);
  for(int i=0; i<n; i++) {
    int p; scanf("%d", &p);
    int x, y;
    if(dic.find(p) == dic.end()) {
      x = n, y = -1;
    } else {
      pair<int, int> pr = dic[p];
      x = pr.first, y = pr.second;
    }
    x = min(x, i);
    y = max(y, i);
    dic[p] = make_pair(x, y);
  }
  map<int, pair<int, int>> ordered_dic(dic.begin(), dic.end());
  for(pair<int, pair<int, int>> kv : ordered_dic) {
    for(int i=kv.second.first; i<=kv.second.second; i++) {
      b[i] = kv.first;
    }
  }
  printf("%d", b[0]);
  for(int i=1; i<n; i++) {
    putchar(' ');
    printf("%d", b[i]);
  }
  putchar('\n');
  return 0;
}