output_description: In the first line, print the sequence S. Two consequtive elements should be
  separated by a space character.
  
  In the second line, print the number of comparisons.
input_description: In the first line _n_ is given. In the second line, _n_ integers are given.
attempt: h, w = [int(n) for n in input().split()]
  
  for i in range(0, h):
      for j in range(0, w):
          print("#", end="")
      print()
  
problem_description: Merge Sort
  
  Write a program of a Merge Sort algorithm implemented by the following
  pseudocode. You should also report the number of comparisons in the Merge
  function.
  
      
      
      Merge(A, left, mid, right)
        n1 = mid - left;
        n2 = right - mid;
        create array L[0...n1], R[0...n2]
        for i = 0 to n1-1
          do L[i] = A[left + i]
        for i = 0 to n2-1
          do R[i] = A[mid + i]
        L[n1] = SENTINEL
        R[n2] = SENTINEL
        i = 0;
        j = 0;
        for k = left to right-1
          if L[i] <= R[j]
            then A[k] = L[i]
                 i = i + 1
            else A[k] = R[j]
                 j = j + 1
      
      Merge-Sort(A, left, right){
        if left+1 < right
          then mid = (left + right)/2;
               call Merge-Sort(A, left, mid)
               call Merge-Sort(A, mid, right)
               call Merge(A, left, mid, right)
samples: [{"input": "10\n    8 5 9 2 6 3 7 1 10 4", "output": "1 2 3 4 5 6 7 8 9 10\n    34"}]