#include<iostream>
#define MAX 1000
using namespace std;
void Insertionsort(int* A, int n);
int main()
{
int Array[MAX], n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> Array[i];
Insertionsort(Array, n);
for(int i = 0; i < n; i++)
cout << Array[i] << ' ';
return 0;
}
void Insertionsort(int *A, int n)
{
for(int i = 1; i < n; i++)
{
int value = A[i];
int hole = i;
while(hole > 0 && A[hole - 1] > A[hole])
{
A[hole] = A[hole - 1];
hole--;
}
A[hole] = value;
}
}