




import os


def 				_a       (				)->  int:
		SCREAMING_SNAKE_CASE_							=       os.path.dirname(os.path.realpath(lowerCAmelCase   )   )
		SCREAMING_SNAKE_CASE_							=       os.path.join(lowerCAmelCase						,	'triangle.txt'   )

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

		while len(lowerCAmelCase   ) != 1:
				SCREAMING_SNAKE_CASE_							=       triangle.pop()
				SCREAMING_SNAKE_CASE_							=       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())





from __future__ import annotations


def 				_a       (				lowerCAmelCase						,	lowerCAmelCase   )->  Union[str, Any]:
		SCREAMING_SNAKE_CASE_							=       0
		SCREAMING_SNAKE_CASE_							=       len(lowerCAmelCase   ) - 1
		while left <= right:
				SCREAMING_SNAKE_CASE_							=       (left + right) // 2
				if left == right:
						if sorted_list[middle] < item:
								SCREAMING_SNAKE_CASE_							=       middle + 1
						break
				elif sorted_list[middle] < item:
						SCREAMING_SNAKE_CASE_							=       middle + 1
				else:
						SCREAMING_SNAKE_CASE_							=       middle - 1
		sorted_list.insert(lowerCAmelCase						,	lowerCAmelCase   )
		return sorted_list


def 				_a       (				lowerCAmelCase						,	lowerCAmelCase   )->  Any:
		SCREAMING_SNAKE_CASE_							=       []
		while left and right:
				if left[0][0] < right[0][0]:
						result.append(left.pop(0   )   )
				else:
						result.append(right.pop(0   )   )
		return result + left + right


def 				_a       (				lowerCAmelCase   )->  List[str]:
		SCREAMING_SNAKE_CASE_							=       len(lowerCAmelCase   )
		if length <= 1:
				return list_ad
		SCREAMING_SNAKE_CASE_							=       length // 2
		return merge(sortlist_ad(list_ad[:middle]   )						,	sortlist_ad(list_ad[middle:]   )   )


def 				_a       (				lowerCAmelCase   )->  list[int]:

		if len(lowerCAmelCase   ) <= 1:
				return collection
		SCREAMING_SNAKE_CASE_							=       []
		SCREAMING_SNAKE_CASE_							=       False
		for i in range(0						,	len(lowerCAmelCase   )						,	2   ):
				if i == len(lowerCAmelCase   ) - 1:
						SCREAMING_SNAKE_CASE_							=       True
				else:
						if collection[i] < collection[i + 1]:
								two_paired_list.append([collection[i], collection[i + 1]]   )
						else:
								two_paired_list.append([collection[i + 1], collection[i]]   )
		SCREAMING_SNAKE_CASE_							=       sortlist_ad(lowerCAmelCase   )
		SCREAMING_SNAKE_CASE_							=       [i[0] for i in sorted_list_ad]
		result.append(sorted_list_ad[-1][1]   )
		if has_last_odd_item:
				SCREAMING_SNAKE_CASE_							=       collection[-1]
				SCREAMING_SNAKE_CASE_							=       binary_search_insertion(lowerCAmelCase						,	lowerCAmelCase   )
		SCREAMING_SNAKE_CASE_							=       False
		for i in range(len(lowerCAmelCase   ) - 1   ):
				if result[i] == collection[-1] and has_last_odd_item:
						SCREAMING_SNAKE_CASE_							=       True
				SCREAMING_SNAKE_CASE_							=       sorted_list_ad[i][1]
				# If last_odd_item is inserted before the item's index,
				# you should forward index one more.
				if is_last_odd_item_inserted_before_this_index:
						SCREAMING_SNAKE_CASE_							=       result[: i + 2] + binary_search_insertion(result[i + 2 :]						,	lowerCAmelCase   )
				else:
						SCREAMING_SNAKE_CASE_							=       result[: i + 1] + binary_search_insertion(result[i + 1 :]						,	lowerCAmelCase   )

		return result


if __name__ == "__main__":
						SCREAMING_SNAKE_CASE:    List[str]											=   input('''Enter numbers separated by a comma:\n''').strip()
						SCREAMING_SNAKE_CASE:    Any											=   [int(item) for item in user_input.split(''',''')]
						print(merge_insertion_sort(unsorted))