#include <bits/stdc++.h>

using namespace std;

const int mxn = 500 * 1000 + 10, mxb = 30 * 1000;

char b[ mxb + 10 ];
int p = mxb;

int v[ mxn ];

int n;

struct S{
    int x;
    S(){
        x = 0;
    }
    S inc(){
        if(p == mxb){
            fread(b, 1, mxb + 1, stdin);
            p = 0;
        }
        else
            p++;
    }
    S operator >> (int& k){
        inc();
        while(b[ p ] >= '0' && b[ p ] <='9'){
            k = k * 10 + (int)(b[ p ] - '0');
            inc();
        }
    }
};



int main()
{
    freopen("algsort.in", "r", stdin);
     freopen("algsort.out", "w", stdout);
    S a;
    a >> n;
    for(int i = 0; i < n; i++)
        a>> v[ i ];
    sort(v, v + n);
    for(int i = 0; i < n; i++)
        printf("%d ", v[ i ]);
    return 0;
}