#include <bits/stdc++.h>
using namespace std;

#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

static const int SIZE = 100000 + 7;

void input(int* arr, int &n) {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
}

int partition(int* arr, int f, int t) {
	int random = f + rand() % (t - f);
	swap(arr[random], arr[t]);

	int pivot = arr[t];

	int i = f;
	for (int j = f; j < t; j++) {
		if (arr[j] <= pivot) {
			swap(arr[i], arr[j]);
			i++;
		}
	}

	swap(arr[i], arr[t]);
	return i;
}

void quicksort(int* arr, int from, int to) {
	if (from >= to) return;

	int mid = partition(arr, from, to);
	quicksort(arr, from, mid - 1);
	quicksort(arr, mid + 1, to);
}

void print(int* arr, int n) {
	for (int i = 0; i < n; i++) {
		cout << arr[i] << " ";
	}
	cout << endl;
}

int n;
int arr[SIZE];

int main() {
	fastIO

	input(arr, n);
	quicksort(arr, 0, n - 1);
	print(arr, n);

	return 0;
}