include[HTML_REMOVED]

using namespace std;
const int N = 10000;
int n;
int q[N];

void quick_sort(int arr[],int l,int r)
{
if (l >= r)
{
return;
}
int key = q[l];
int i = l;
int j = r;
while (i < j)
{
while (i < j && q[i] < key)i++;
while (i[HTML_REMOVED]key)j–;
if (i < j)swap(q[i], q[j]);
}
quick_sort(q, l, j);
quick_sort(q, j+1, r);
}

int main()
{
scanf(“%d”, &n);
for (int i = 0; i < n; i++)scanf(“%d”, &q[i]);

quick_sort(q,0,n-1);

for (int i = 0; i < n; i++) cout << q[i];

return 0;

}