include[HTML_REMOVED]

using namespace std;
int N=1e6+10;
int q[N];
void quick_sort(int q[],int l,int r)
{
if(l>=r)return 0;
int x=q[l],i=l-1,j=r+1;
while(i[HTML_REMOVED]q[x]);
if(i<j)swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);

}
int main()
{

int y;
scanf("%d",&y);
for(int p=0;p<y;p++) scanf("%d",&q[p]);
quick_sort(q,0,m-1);
for(int p=0;p<y;p++) printf("%d",q[p]);

return 0;

}