#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
FILE*fin=fopen("algsort.in","r");
FILE*fout=fopen("algsort.out","w");
int i,j,k,m,l,n,w[500005];
vector <int> v;
int main()
{
    fscanf(fin,"%d%d",&n);
    for(i=1;i<=n;i++)
    v.push_back(fscanf(fin,"%d",&a));

    sort(v.begin(),v.end());

    for(i=0;i<n;i++)
    fprintf(fout,"%d",a));

    return 0;
}