#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

#define nmax 500005

int n, v[nmax];

struct cmp{
    bool operator () (const int &a, const int &b){//punand "&" fac ape prin referinta nu si prin valoare merge mai repede
        return v[a] < v[b];
    }
};

int main(){

    ifstream f("algsort.in");
    ofstream g("algsort.out");

    f >> n;
    for(int i=1; i<=n; i++) f>>v[i];

    sort(v+1, v+n+1, cmp() );

    for(int i=1; i<=n; i++) g << v[i];

    f.close();
    g.close();

    return 0;

}