#include<stdio.h>
#include<vector>
#include<algorithm>

using namespace std;

vector < int > v;

int n, i, val;

int main()
{
	FILE *f = fopen("algsort.in", "r");
	
	fscanf(f, "%d", &n);
	for(i = 0; i < n; ++i)
		fscanf(f, "%d", &val), v.push_back(val);
	
	fclose(f);
	
	sort(v.begin(), v.end());
	
	FILE *g = fopen("algsort.out", "w");
	
	for(i = 0; i < n; ++i)
		fprintf(g, "%d ", v[i]);
	
	fprintf(g, "\n");
	
	fclose(g);
	
	return 0;
}