content: //Sorting Algorithm-->Quicksort(part1-->partition)
  
  import java.io.*;
  import java.math.*;
  import java.security.*;
  import java.text.*;
  import java.util.*;
  import java.util.concurrent.*;
  import java.util.regex.*;
  
  public class Solution {
  
      
      static int[] quickSort(int[] arr) {
             //initializing the pivot 
             int pivot=arr[0];
             
          for(int i = 1; i < arr.length; i++){    
          // if pivot > current element of arr
          // shift current element to left of pivot
          if(pivot > arr[i]){
              for(int j = i; j > 0; j--){
                  //swapping the elements
                  int temp=arr[j];
                  arr[j]=arr[j-1];
                  arr[j-1]=temp;
              }
          }
      }
      return arr;
             
      }
  
      private static final Scanner scanner = new Scanner(System.in);
  
      public static void main(String[] args) throws IOException {
          BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
  
          int n = scanner.nextInt();
          scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
  
          int[] arr = new int[n];
  
          String[] arrItems = scanner.nextLine().split(" ");
          scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
  
          for (int i = 0; i < n; i++) {
              int arrItem = Integer.parseInt(arrItems[i]);
              arr[i] = arrItem;
          }
  
          int[] result = quickSort(arr);
  
          for (int i = 0; i < result.length; i++) {
              bufferedWriter.write(String.valueOf(result[i]));
  
              if (i != result.length - 1) {
                  bufferedWriter.write(" ");
              }
          }
  
          bufferedWriter.newLine();
  
          bufferedWriter.close();
  
          scanner.close();
      }
  }