






import os




def       _a   (							)  ->      List[Any]:
 lowerCamelCase_							:    List[str]							=     os.path.dirname(os.path.realpath(lowerCamelCase_				)				)
 lowerCamelCase_							:    Any							=     os.path.join(lowerCamelCase_ ,			'triangle.txt'				)

 with open(lowerCamelCase_				) as in_file:
  lowerCamelCase_							:    List[str]							=     [[int(lowerCamelCase_				) for i in line.split()] for line in in_file]

 while len(lowerCamelCase_				) != 1:
  lowerCamelCase_							:    Union[str, Any]							=     triangle.pop()
  lowerCamelCase_							:    Any							=     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())

def  UpperCAmelCase__(    lowerCamelCase_	):



			"""simple docstring"""





			_snake_case														=   len(lowerCamelCase_	)
			_snake_case														=   [0] * length
			_snake_case														=   [[False for i in range(lowerCamelCase_	)] for j in range(lowerCamelCase_	)]
			for i, c in enumerate(lowerCamelCase_	):
						_snake_case														=   i
						for j in range(i + 1	):
									if c == string[j] and (i - j < 2 or is_palindromic[j + 1][i - 1]):
												_snake_case														=   True
												_snake_case														=   min(lowerCamelCase_				,						0 if j == 0 else (cut[j - 1] + 1)	)
						_snake_case														=   mincut
			return cut[length - 1]


if __name__ == "__main__":
			_SCREAMING_SNAKE_CASE:    Dict     						=							input('''Enter the string: ''').strip()
			_SCREAMING_SNAKE_CASE:    str     						=							find_minimum_partitions(s)
			print(F"Minimum number of partitions required for the '{s}' is {ans}")

