#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cctype>

#define pb push_back
#define mp make_pair
#define MAXN 500001
#define Dim 8192
#define INFILE "algsort.in"
#define OUTFILE "algsort.out"

using namespace std;

class Reader
{
public:
    Reader(const char* filename)
    {
        f.open(filename);
        pos = 0;
    }
    void operator >>(int& x)
    {
        if(buffer[0]==0)f.read(buffer,Dim);
        else
            while(buffer[pos]<'0'||buffer[pos]>'9')
                if(++pos==Dim)
                    f.read(buffer,Dim),pos=0;
        while(buffer[pos]>='0'&&buffer[pos]<='9')
        {
            x=x*10+buffer[pos]-'0';
            if(++pos==Dim)f.read(buffer,Dim),pos=0;
        }
    }
    void operator >>(char* c)
    {
        int aux = 0;
        if(buffer[0]==0)f.read(buffer,Dim);
        else
            while(isspace(buffer[pos]))
                if(++pos==Dim)
                    f.read(buffer,Dim),pos=0;
        while(!isspace(buffer[pos]))
        {
            c[aux++]=buffer[pos];
            if(++pos==Dim)f.read(buffer,Dim),pos=0;
        }
    }
    ~Reader()
    {
        f.close();
    }
private:
    ifstream f;
    int pos;
    char buffer[Dim];
};
Reader f(INFILE);
ofstream g(OUTFILE);
int n,v[MAXN];
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        f>>v[i];
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++)
        g<<v[i]<<" ";
    g.close();
    return 0;
}