#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>
#include <vector>

using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");

int n, mn = 20000000, mx, v[5002], x[5002],u;

vector <int> k;

int main()
{
    f >> n;
    for (int i = 1; i <= n; i++){
        f >> v[i];
        if (mn > v[i]){
            mn = v[i];
        }
        if (mx < v[i]){
            mx = v[i];
        }
        x[i] = v[i];
    }
    sort (v + 1,v + n + 1);
    for (int i = 2; i <= n; i++){
        if (v[i] != v[i-1]) k.push_back(v[i-1]);
    }
    for (int i = 1; i <= n; i++){
        if (x[i] == mn){
            u = i;
            while (x[u] != mx){
                g << x[u] << " ";
                u++;
            }
            g << mx;
            return 0;
        }
    }
    return 0;
}