content: //Time complexity-O(n*log(n))
  import java.util.Scanner;
  class Main{
      public static int partition(int arr[], int low, int high)
      {
          int pivot = arr[high]; 
          int i = (low-1);
          for (int j=low; j<high; j++)
          {
              if (arr[j] <= pivot)
              {
                  i++;
    
  
                  int temp = arr[i];
                  arr[i] = arr[j];
                  arr[j] = temp;
              }
          }
  
          int temp = arr[i+1];
          arr[i+1] = arr[high];
          arr[high] = temp;
    
          return i+1;
      }
      public static void sort(int arr[], int low, int high)
      {
          if (low < high)
          {
  
              int pi = partition(arr, low, high);
    
              sort(arr, low, pi-1);
              sort(arr, pi+1, high);
          }
      }
      public static void print(int arr[],int n){
          for (int i=0; i<n; ++i)
              System.out.print(arr[i]+" ");
          System.out.println();
      }
    
      /*This code is contributed by Abhishek Chauhan */
      public static void main(String args[])
      {
        Scanner sc=new Scanner(System.in);
  					int n=sc.nextInt();
            int arr[] = new int[n];
  
  		      for(int i=0;i<n;i++){
  			      arr[i]=sc.nextInt();
  		      }
          sort(arr, 0, n-1);
          print(arr,n);
      }
  }