#include<iostream>
using namespace std;
void quicksort(int numarray[],int low,int high)
{
if(low>=high)
{
return;
}
int key;
int first=low;
int last=high;
key=numarray[first];
while(last>first)
{
while(last>first&&numarray[last]>=key)
{
last--;
}
numarray[first]=numarray[last];
while(numarray[first]<=key&&last>first)
{
first++;
}
numarray[last]=numarray[first];
}
numarray[last]=key;
quicksort(numarray,low,first-1);
quicksort(numarray,first+1,high);
}
int main()
{
int size,i;
cin>>size;
int numarray[size];
// int *p=new numarray[size];
for(i=0;i<size;i++)
{
cin>>numarray[i];
}
quicksort(numarray,0,size-1);
for(i=0;i<size;i++)
{
cout<<numarray[i];
}
// delete[] numarray;
return 0;
}
using namespace std;
void quicksort(int numarray[],int low,int high)
{
if(low>=high)
{
return;
}
int key;
int first=low;
int last=high;
key=numarray[first];
while(last>first)
{
while(last>first&&numarray[last]>=key)
{
last--;
}
numarray[first]=numarray[last];
while(numarray[first]<=key&&last>first)
{
first++;
}
numarray[last]=numarray[first];
}
numarray[last]=key;
quicksort(numarray,low,first-1);
quicksort(numarray,first+1,high);
}
int main()
{
int size,i;
cin>>size;
int numarray[size];
// int *p=new numarray[size];
for(i=0;i<size;i++)
{
cin>>numarray[i];
}
quicksort(numarray,0,size-1);
for(i=0;i<size;i++)
{
cout<<numarray[i];
}
// delete[] numarray;
return 0;
}