#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <climits>
#include <cassert>
#include <iomanip>

using namespace std;


const string file = "algsort";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)
#define maxn 200001

int N;
vi V;

void quickSort(vi &V, int L, int R) {
	if (L >= R) {
		return;
	}
	int mid = (L + R) / 2;
	int left = L - 1, rig;
	swap(V[mid], V[R]);
	for (int in = L; in < R; ++in) {
		if (V[in] < V[R]) {
			++left;
			swap(V[left], V[in]);
		}
	}
	swap(V[left + 1], V[R]);
	rig = R + 1;
	for (int in = R; in > left; --in) {
		if (V[in] > V[left + 1]) {
			--rig;
			swap(V[rig], V[in]);
		}
	}
	quickSort(V, rig, R);
	quickSort(V, L, left);
}

int main() {
#ifndef INFOARENA
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif
	scanf("%d\n", &N);
	V.resize(N);
	for (auto &x: V) {
		scanf("%d", &x);
	}
	quickSort(V, 0, N - 1);
	for (auto x: V) {
		printf("%d ", x);
	}
	return 0;
}