// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTINF (int)(9223372036854775807)
#define int long long
#define MAXN 200010



int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];
    int pos = n - 1;
    while (pos && a[pos-1] < a[pos]) {
        --pos;
    }
    debug(pos)
    vector<int> v;
    int minv = INTINF;
    rep(i, pos, n) minv = min(minv, a[i]);
    rep(i, pos - 1, n) if (a[i] != minv) v.push_back(a[i]);
    auto cmp = [](int x, int y) {return x > y;};
    sort(v.begin(), v.end(), cmp);
    rep(i, 0, pos - 1) cout << a[i] << " ";
    cout << minv;
    rep(i, 0, sz(v)) cout << " " << v[i];
    cout << endl;

    return 0;
}