#include <iostream>
#include <queue>
using namespace std;
priority_queue<int> Q;
int n, v[500005];
int main()
{
	(void)! freopen("algsort.in", "r", stdin);
	(void)! freopen("algsort.out", "w", stdout);
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> v[i];
	for(int i = 0; i < n; ++i)
		Q.push(v[i]);
	for(int i = n - 1; i >= 0; --i)
		v[i] = Q.top(), Q.pop();
	for(int i = 0; i < n; ++i)
		cout << v[i];
	return 0;
}