#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];
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", a + i);
	for (int i = 0; i < (n - 1); i++)
		for (int j = i + 1; j < n; j++)
			if (a[i] + a[j] < 2 * n - 3 && a[i] > a[j])
				swap(a[i], a[j]);
	printf("%d", a[0]);
	for (int i = 1; i < n; i++)
		printf(" %d", a[i]);
	printf("\n");
}