#include <bits/stdc++.h>
using namespace std;
ofstream g("lalgsort.out");
struct solver
{
    //vector<int> v;
    int p=31999;
    char buffer[32001];
    solver()
    {
        freopen("algsort.in","r",stdin);
        inc();
    }
    void operator>>(int &x)
    {
        while(buffer[p]<'0'||buffer[p]>'9')
            inc();
        x=0;
        while(buffer[p]>='0'&&buffer[p]<='9')
        {
            x=10*x+buffer[p]-'0';
            inc();
        }

    }
    void operator>>(vector<int> &a)
    {
        int n,x;
        *this>>n;
        for(;n;n--)
        {
            *this>>x;
            a.push_back(x);
        }
        sort(a.begin(),a.end());
        ofstream g("lagsort.out");
        for(auto it:a)
            g<<it<<" ";
    }

    void inc()
    {
        p++;
        if(p==32000)
        {
            fread(buffer,1,32000,stdin);
            p=0;
        }
    }
};
vector<int> v;
int main()
{
    solver f;
    f>>v;
    return 0;
}