#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{freopen ("algsort.in", "r", stdin);
freopen ("algsort.out", "w", stdout);
int n;
vector <int> V;
scanf ("%d", &n);
int x;
for (int i=0;i<n;i++){
        scanf("%d", &x);
V.push_back(x);}
sort(V.begin(),V.end());
for (int i=0;i<n;i++){
     printf( "%d ", V[i] );
}
        return 0;
}