#include<iostream>
#include<vector>
using namespace std;
void bubble_sort(vector<int>& v, int L, int R)
{
if (L == R)
{
return;
}
for (int i = L; i < R; i++)
{
if (v[i] > v[i + 1])
{
int temp;
temp = v[i + 1];
v[i + 1] = v[i];
v[i] = temp;
}
}
bubble_sort(v, L, R - 1);
}
int main()
{
int n;
cin >> n;
vector<int> nums;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
nums.push_back(temp);
}
bubble_sort(nums, 0, nums.size() - 1);
for (int i = 0; i < nums.size(); i++)
{
cout << nums[i];
}
return 0;
}