#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, a[N];

void quicksort(int a[], int l, int r) {
    int i = l, j = r, flg = a[(l + r) / 2];
    while (i < j) {
        while (a[i] < flg) i++;
        while (a[j] > flg) j--;
        if (i < j) {
            swap(a[i], a[j]); 
            i++, j--;
        }
    }
    if (l < i) quicksort(a, l, i);
    if (j < r) quicksort(a, j, r);
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    quicksort(a, 1, n);
    for (int i = 1; i <= n; i++) cout << a[i];
    return 0;
}