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

using namespace std;

int n, i, x;
vector <int> V;


int main(){

	FILE *f = fopen("algosort.in", "r");
	FILE *g = fopen("algosort.out", "w");
	
	fscanf(f,"%d",&n);
	for(i=1; i<=n; i++){
		fscanf(f,"%d",&x);
		V.push_back(x);
	}
	
	sort(V.begin(), V.end());
	
	for(i=0; i < V.size(); i++)
		fprintf(g,"%d ",V[i]);
	
	fclose(f);
	fclose(g);
	
	return 0;
}