#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

vector <long> v;

long N, i, x;

int main() {
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	
		scanf("%ld", &N);
		
		for (i = 0; i < N; ++i) {
			scanf("%ld", &x);
			v.push_back(x);
		}
		
		sort(v.begin(), v.end());
		
		for (i = 0; i < N; ++i) {
			printf("%ld ", v[i]);
		}		
		printf("\n");
	
	
	return 0;
}