#include <iostream>
#include <fstream>
#define TOTAL_BYTE 2
#define get_byte(x) ((x >> (16 * byte)) & 0xFFFF)
#define RADIX_SIZE 16
#define BUFF_SIZE 100000

using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");
int *a, n;
char BUFF[BUFF_SIZE];
int pos = 0;

void Read(int &a)
{
    while(!isdigit(BUFF[pos]))
        if(++pos == BUFF_SIZE)
            in.read(BUFF,BUFF_SIZE), pos = 0;
    a = 0;
    while(isdigit(BUFF[pos]))
    {
        a = a * 10 + (BUFF[pos] - '0');
        if(++pos == BUFF_SIZE)
            in.read(BUFF,BUFF_SIZE), pos = 0;
    }
}

void CountSort(int a[], int b[], int byte, int n)
{
    int _count[1 << RADIX_SIZE];
    int ind[1 << RADIX_SIZE];
    int length = (1 << RADIX_SIZE) - 1;
    for (int i = 0; i <= length; i++)
        _count[i] = 0;
    for (int i = 1; i <= n; i++)
        _count[get_byte(a[i])]++;
    ind[0] = 1;
    for (int i = 1; i <= length; i++)
        ind[i] = ind[i - 1] + _count[i - 1];
    for (int i = 1; i <= n; i++)
        b[ind[get_byte(a[i])]++] = a[i];
}

void RadixSort(int a[], int n)
{
    int *temp = new int[n+1];
    for (int i = 0; i < TOTAL_BYTE; i++)
        if (i % 2 == 0)
            CountSort(a,temp,i,n);
        else
            CountSort(temp,a,i,n);
    delete[] temp;
}

int main()
{
    Read(n);
    a = new int[n+1];
    for (int i = 1; i <= n; i++)
        Read(a[i]);
    in.close();
    RadixSort(a,n);
    for (int i = 1; i <= n; i++)
        out << a[i] << " ";
    out.close();
    delete[] a;
    return 0;
}