#include <bits/stdc++.h>
#define Bucket_size 8
using namespace std;

class parser{
    public:
        parser() {}
        parser(const char *file_name){
            input_file.open(file_name,ios::in | ios::binary);
            input_file.sync_with_stdio(false);
            index=0;
            input_file.read(buffer,SIZE);}
        inline parser &operator >>(int &n){
            for (;buffer[index]<'0' or buffer[index]>'9';inc());
            n=0;
            for (;'0'<=buffer[index] and buffer[index]<='9';inc())
                n=10*n+buffer[index]-'0';
            return *this;}
            ~parser(){
            input_file.close();}
    private:
        fstream input_file;
        static const int SIZE=0x200000;
        char buffer[SIZE];
        int index=0;
        inline void inc(){
            if(++index==SIZE)
                index=0,input_file.read(buffer,SIZE);}
};

class writer{
    public:
        writer() {};
        writer(const char *file_name){
            output_file.open(file_name,ios::out | ios::binary);
            output_file.sync_with_stdio(false);
            index=0;}
        inline writer &operator <<(int target){
            aux=0;
            n=target;
            if (!n)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=n%10+'0';
            for(;aux;inc())
                buffer[index]=nr[--aux];
            return *this;}
        inline writer &operator <<(const char *target){
            aux=0;
            while (target[aux])
                buffer[index]=target[aux++],inc();
            return *this;}
        ~writer(){
            output_file.write(buffer,index);output_file.close();}
    private:
        fstream output_file;
        static const int SIZE=0x200000;
        int index=0,aux,n;
        char buffer[SIZE],nr[24];
        inline void inc(){
            if(++index==SIZE)
                index=0,output_file.write(buffer,SIZE);}
};

parser f ("algsort.in");
writer g ("algsort.out");

int n;
vector <unsigned int> V;

void radixsort(int bits)
{
    vector <unsigned int> Sorted_Bucket[(1<<Bucket_size)];

    for(auto it:V)  Sorted_Bucket[(it>>bits)&((1<<Bucket_size)-1)].push_back(it);

    for(int i=0,n=0; i<(1<<Bucket_size); ++i)
        for(auto it:Sorted_Bucket[i]) V[n++]=it;
}

int main()
{
    int x;
    f>>n;
    for(int i=0; i<n; ++i)   f>>x,V.push_back(x);
    for(int i=0; i<32; i+=Bucket_size) radixsort(i);
    for(auto it:V) g<<it<<" ";
}