#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#define FILEIO(filename) (freopen(filename ".in", "r", stdin), freopen(filename ".out", "w", stdout))
typedef long long ll;
typedef unsigned long long ull;
const int N = 200005;
int n, a[N];
struct node
{
    int l, r, c;
} stk[N];
int top;
std::map<int, int> mp;
int main(void)
{
    scanf("%d", &n);
    for (int i = 1;i <= n;++i)
        scanf("%d", a + i);
    for(int i = 1;i <= n;++i)
    {
        if(!mp[a[i]])
            ++mp[a[i]], stk[++top] = {i, i, a[i]};
        else
        {
            while(stk[top].c != a[i])
                --mp[stk[top--].c];
            ++mp[a[i]], stk[top + 1] = {stk[top].r + 1, i, a[i]}, ++top;
        }
    }
    for (int i = 1;i <= top;++i)
        for (int j = stk[i].l; j <= stk[i].r;++j)
            printf("%d\n", stk[i].c);
    return 0;
}