#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n;
    cin >> n;
    VI a(n); 
    REP(i,n) cin >> a[i];
    REP(i,2*n-3){
        REP(p,i/2+1){
            int q = i-p;
            if (p >= n || q >= n) continue;
            if (a[p] > a[q]) swap(a[p],a[q]);
        }
    }
    REP(i,n) cout << a[i] << " ";
    cout << endl;
    return 0;
}