#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>

#define INF (1<<30)
#define mod 666013

using namespace std;

int n, i, j, elMax, bkSize, x, bk, q;
vector <int> v[500005];

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);
    scanf("%d", &n);
    elMax = (1 << 30) - 1 + (1 << 30);
    bkSize = elMax / n;
    bkSize++;
    for(i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        bk = x / bkSize;
        v[bk].push_back(x);
    }
    for(i = 0; i <= n; i++)
    {
        sort(v[i].begin(), v[i].end());
        for(j = 0; j < v[i].size(); j++)
            printf("%d ", v[i][j]);
    }
    return 0;
}