#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("popcnt,avx2")
#define ll long long
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define all(a) (a).begin(),(a).end()
using namespace std;
const int maxn = 500005;


ifstream fin("algsort.in");
ofstream fout("algsort.out");

int partition(int*& a, int low, int high) {
    int pivot = a[low];
    int i = low - 1;
    int j = high + 1;
    while (1) {
        i++;
        while (a[i] < pivot) {
            i++;
        }
        j--;
        while (a[j] > pivot) {
            j--;
        }
        if (i >= j) {
            return j;
        }
        swap(a[i], a[j]);
    }
}

void quick_sort(int*& a, int low, int high) {
    if (low >= high) {
        return;
    }
    int pivot = partition(a, low, high);
    quick_sort(a, pivot + 1, high);
    quick_sort(a, low, pivot); 
}

void solve() {
    FILE* in = fopen("algsort.in", "r");
    FILE* out = fopen("algsort.out", "w");
    int n;
    fscanf(in, "%d", &n);
    int *a = new int[n];
    for (int i = 0; i < n; i++) {
        fscanf(in, "%d", &a[i]);
    }
    quick_sort(a, 0, n - 1);
    for (int i = 0; i < n; i++) {
        fprintf(out, "%d", a[i]);
    }
}
 
int main() {
    int t = 1;
    // fin >> t;
    while (t--) {
        solve();
    }
    return 0;
}