





def _a							(      lowerCamelCase:  list					)      ->		list:







      '''simple docstring'''






      __A			  =							len(lowerCamelCase					)
      for cycle_start in range(0   ,							array_len - 1					):
            __A			  =							array[cycle_start]

            __A			  =							cycle_start
            for i in range(cycle_start + 1   ,							lowerCamelCase					):
                  if array[i] < item:
                        pos += 1

            if pos == cycle_start:
                  continue

            while item == array[pos]:
                  pos += 1

            __A  ,		__A			  =							item, array[pos]
            while pos != cycle_start:
                  __A			  =							cycle_start
                  for i in range(cycle_start + 1   ,							lowerCamelCase					):
                        if array[i] < item:
                              pos += 1

                  while item == array[pos]:
                        pos += 1

                  __A  ,		__A			  =							item, array[pos]

      return array


if __name__ == "__main__":
       assert cycle_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
       assert cycle_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]












import os



def _a							(      )      ->		int:







      '''simple docstring'''






      __A			  =							os.path.dirname(os.path.realpath(lowerCamelCase					)					)
      __A			  =							os.path.join(lowerCamelCase   ,							'''triangle.txt'''					)

      with open(lowerCamelCase					) as in_file:
            __A			  =							[[int(lowerCamelCase					) for i in line.split()] for line in in_file]

      while len(lowerCamelCase					) != 1:
            __A			  =							triangle.pop()
            __A			  =							triangle[-1]
            for j in range(len(lowerCamelCase					) - 1					):
                  curr_row[j] += max(last_row[j]   ,							last_row[j + 1]					)
      return triangle[0][0]


if __name__ == "__main__":
       print(solution())





