import java.util.*;
public class Main
{
    
    
    void insertionSort(int arr[],int n)
    {
        
        for(int i=1;i<n;i++)
        {
            
            int key=arr[i];
            int j=i-1;
            while(j>=0 && arr[j]>key){
                arr[j+1]=arr[j];
                j--;
            }
            arr[j+1]=key;
            
        }
        for(int i=0;i<n;i++)
        {
            System.out.print(arr[i]+" ");
        }
    }
    public static void main(String[] args)
    {
        Scanner s=new Scanner(System.in);
        Main obj=new Main();
        if(!s.hasNextInt())
        {
           System.out.println("Invalid input"); 
            return;
        }
        int n=s.nextInt();
        
        
        if(n<0 || n>100)
        {
            System.out.println("Invalid input");
            return;
        }
        
       
        int arr[]=new int[n];
        for(int i=0;i<n;i++)
        {
            if(!s.hasnextInt())
            {
                system.out.println("Invalid input");
                return;
            }
        
            arr[i]=s.nextInt();
        }
        obj.insertionSort(arr,n);
        
        
    }
}