give me this pizza

#include <iostream>
#include <vector>
#include <map>
#include <string.h>
#include <math.h>
#include <set>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define cy cout << "YES\n"
#define cn cout << "NO\n"
#define nl "\n"
#define fi first
#define se second
#define MOD 1000000007
#define inf 2000000000
#define PI acos(-1)
#define all(v) v.begin(), v.end()
constexpr ll LINF = 1LL << 62;
#define sz(s) s.size()
#define f0r(j, n) for (ll i = j; i < n; i++)
#define cin_2d(vec, n, m)                               \
    for (int i = 0; i < n; i++)                         \
        for (int j = 0; j < m && cin >> vec[i][j]; j++) \
            ;
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0)

template <typename T = int>
istream &operator>>(istream &in, vector<T> &v)
{
    for (auto &x : v)
        in >> x;
    return in;
}

template <typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v)
{
    for (const T &x : v)
        out << x << " ";
    return out;
}

void sherry()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

void solve()
{
    int n;
    cin >> n;
    vector<int> v(n), fre(55, -1), ans(n);
    cin >> v;
    for (int i = n - 1; i >= 0; i--)
    {
        fre[v[i]] = i;
        int num = n + 1;
        for (int j = v[i] + 1; j <= 50; j++)
        {
            if (fre[j] != -1)
            {
                num = min(num, fre[j]);
            }
        }
        ans[i] = ((num == n + 1) ? -1 : v[num]);
    }
    cout << ans;
}
int main()
{
    sherry();
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}