/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<unsigned int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  4398042316799LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
ifstream f("algsort.in");
ofstream g("algsort.out");
queue<int> q[2][base];
int x,n,r,p;
int main ()
{


    f>>n;
    FOR(i,1,n)
    {
        f>>x;
        q[p][x&bas].push(x);
    }

    r=1;
    FOR(i,0,2)
    {
        r*=base;
        REP(j,base)
        {
            while(!q[p][j].empty())
            {
                x=q[p][j].front();
                q[p][j].pop();
                q[1-p][(x/r)&bas].push(x);
            }
        }
        p=1-p;
    }
    REP(i,base)
    while(!q[p][i].empty())
    {
        g<<q[p][i].front()<<" ";
        q[p][i].pop();
    }
    return 0;
}