// Made by ordinary newbie
#pragma region setup
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
// variables
#define int long long
using ld = long double;
using ll = long long;
using ull = unsigned long long;
template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
// bitwise operations
#define cnt_bit(n) __builtin_popcountll(n)
#define low_bit(n) ((n) & (-(n)))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_bit(n, i) ((n) | (1ll << (i)))
#define reset_bit(n, i) ((n) & ~(1ll << (i)))
#define flip_bit(n, i) ((n) ^ (1ll << (i)))
// math
#define sqr(n) ((n) * (n))
int log2_floor(ull n) {
return n ? __builtin_clzll(1) - __builtin_clzll(n) : -1;
}
const ll INF = 1e18;
// utils
#define len(x) (int) x.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
for(auto& el : v) {
is >> el;
}
return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (int i = 0; i < len(v); i++) {
if (i) os << ' ';
os << v[i];
}
return os;
}
template<class... Args>
auto create(size_t n, Args&&... args) {
if constexpr(sizeof...(args) == 1) {
return vector(n, args...);
}
else {
return vector(n, create(args...));
}
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(pair<int, int> x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x.first + FIXED_RANDOM) ^ splitmix64(x.second + FIXED_RANDOM);
}
};
template<typename T, typename U>
bool chmin(T& a, const U b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename T, typename U>
bool chmax(T& a, const U b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template<typename T>
void compress(vector<T>& v) {
int n = len(v);
vector<pair<T, int>> u(n);
for (int i = 0; i < n; i++) {
u[i] = {v[i], i};
}
sort(all(u));
int curr = 0;
for (int i = 0; i < n; i++) {
if (i != 0 && u[i].first != u[i - 1].first) curr++;
v[u[i].second] = curr;
}
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
#pragma endregion
template <int MOD = 1000000007>
struct mod_int {
int value;
mod_int(ll v = 0) { value = v % MOD; if (value < 0) value += MOD;}
mod_int(ll a, ll b) : value(0){ *this += a; *this /= b;}
mod_int& operator+=(mod_int const& b) {value += b.value; if (value >= MOD) value -= MOD; return *this;}
mod_int& operator-=(mod_int const& b) {value -= b.value; if (value < 0) value += MOD;return *this;}
mod_int& operator*=(mod_int const& b) {value = (ll)value * b.value % MOD;return *this;}
friend mod_int mexp(mod_int a, ll e) {
mod_int res = 1; while (e) { if (e&1) res *= a; a *= a; e >>= 1; }
return res;
}
friend mod_int inverse(mod_int a) { return mexp(a, MOD - 2); }
mod_int& operator/=(mod_int const& b) { return *this *= inverse(b); }
friend mod_int operator+(mod_int a, mod_int const b) { return a += b; }
friend mod_int operator-(mod_int a, mod_int const b) { return a -= b; }
friend mod_int operator-(mod_int const a) { return 0 - a; }
friend mod_int operator*(mod_int a, mod_int const b) { return a *= b; }
friend mod_int operator/(mod_int a, mod_int const b) { return a /= b; }
friend std::ostream& operator<<(std::ostream& os, mod_int const& a) {return os << a.value;}
friend bool operator==(mod_int const& a, mod_int const& b) {return a.value == b.value;}
friend bool operator!=(mod_int const& a, mod_int const& b) {return a.value != b.value;}
};
void solve() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
vector<pair<int, int>> b;
set<int> used;
for (int i = 0; i < n; i++) {
if (used.count(a[i])) {
int delta = 1;
while (b.back().first != a[i]) {
delta += b.back().second;
used.erase(b.back().first);
b.pop_back();
}
b.back().second += delta;
}
else {
used.insert(a[i]);
b.push_back({a[i], 1});
}
}
for (auto [val, cnt] : b) {
for (int i = 0; i < cnt; i++) {
cout << val << '\n';
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
for (int i = 1; i <= tt; i++) {
solve();
}
}
