#include <vector>
#include <cstdio>
#include <algorithm>

using namespace std;

int main ()
{
	FILE *in, *out;
	vector <int> v;	
	int n, value;	
	in=fopen("algsort.in", "r");
	out=fopen("algsort.out", "w");
	fscanf(in, "%d", &n);
	
	for(int i=0; i<n; ++i)
	{
		fscanf(in, "%d", &value);
		v.push_back(value);
	}
	sort(v.begin(), v.end());
	
	for(vector <int>::iterator i=v.begin(); i!=v.end(); ++i)
	{
		fprintf(out, "%d", *i);
	}
	return 0;
}