#include <stdio.h>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <iostream>
using namespace std;
using ll = long long;

void solve();
int main() {
	solve();
#ifdef DBG
	while (true);
#endif
}

//490
void solve() {
	int n, a[2000], p, q;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", a + i);
	for (int i = 1; i < 2 * n - 3; i++) {
		q = min(n - 1, i);
		p = i - q;
		while (p < q) {
			if (a[p] > a[q])
				swap(a[p], a[q]);
			p++, q--;
		}
	}
	printf("%d", a[0]);
	for (int i = 1; i < n; i++)
		printf(" %d", a[i]);
	printf("\n");
}