#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <limits.h>
#include <set>
#define nmax 500010
using namespace std;
int i,j,n,v[nmax],aux[nmax],x[256];
int main(){
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&v[i]);
for (i=0;i<25;i+=8){
    for (j=1;j<=n;j++) x[(v[j]>>i)&255]++;
    for (j=1;j<=255;j++)
        x[j]=x[j-1]+x[j];
    for (j=n;j>=1;j--){
        aux[x[(v[j]>>i)&255]]=v[j];
        x[(v[j]>>i)&255]--;
    }
    for (j=1;j<=n;j++)
        v[j]=aux[j];
}
for (j=1;j<=n;j++) printf("%d ",v[j]);
return 0;
}