#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int main()
{
	int n;
	cin >> n;

	ll a[2010];

	for (int i = 0; i < n; i++)
		cin >> a[i];


	for (int i = 1; i <= 2 * n - 4; i++) {
		for (int j = 0; j < n; j++) {
			if (j < i - j && i-j < n) {
				if (a[j] > a[i - j])
					swap(a[j], a[i - j]);
			}
		}
	}

	for (int i = 0; i < n; i++) {
		cout << a[i];
		if (i != n - 1)cout << " ";
	}
	cout << endl;
	return 0;
}