#include<iostream>
#include<vector>
#include<queue>
#include<cassert>
#include<algorithm>
#define int unsigned
#define pb push_back
using namespace std;
using pii = pair<int,int>;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }

public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }

    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

const int B = 8;
const int BITS = 32;

int v[500'001], b[32];

signed main()
{
    InParser fin("algsort.in");
    OutParser fout("algsort.out");

    int n; fin >> n;
    for(int i = 0 ; i < n ; i++)
        fin >> v[i];

    int m = 1; b[0] = 1;  vector<int> f[1 << B];
    for(int i = 1; i < 31 ; i++) b[i] = (b[i - 1] | (1 << i));
    for(int i = 0 ; (i + 1) * B <= BITS ; i++)
        {

            for(int j = 0 ; j < n ; j++)
                {
                    m = (v[j] >> (i * B));
                    m &= b[B - 1]; f[m].emplace_back(v[j]);
                }

            int now = 0;
            for(int j = 0 ; j < (const int)(1 << B) ; j++)
                {
                    for(auto &it : f[j])
                        v[now++] = it;
                    f[j].clear();
                }

        }

    //assert(is_sorted(v, v + n));
    for(int i = 0 ; i < n ; i++)
        fout << v[i] << " ";
}