#include <stdio.h>
void insertionSort1(int n, int arr[n]) {
int j;
for(int i=1;i<=n-1;i++){
int e = arr[i];
for(int j=i-1;j>=0 && arr[j]>e;j–){
arr[j+1]=arr[j];
}
arr[j+1]=e;
}
for(int k=0;k<n;k++){
printf("%d",arr[k]);
}
}
int main()
{
int n = 0;
scanf("%d",&n);
int arr[n];
for(int i = 0; i < n; i++){
scanf("%d",&arr[i]);
}
insertionSort1(n, arr);
return 0;
}