






from __future__ import annotations







def 		_UpperCamelCase      (			UpperCamelCase_				:    list[int | float]						)     ->      int | float:

						"""simple docstring"""



						if len(UpperCamelCase_						) == 0:
												raise ValueError('find_max() arg is an empty sequence'						)
						lowerCAmelCase__			  =  nums[0]
						for x in nums:
												if x > max_num:
																		lowerCAmelCase__			  =  x
						return max_num


if __name__ == "__main__":
					import doctest

					doctest.testmod(verbose=True)













def 		_UpperCamelCase      (			UpperCamelCase_				:    str						)     ->      int:

						"""simple docstring"""



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


if __name__ == "__main__":
					__snake_case			:			Optional[Any]			   =   input("""Enter the string: """).strip()
					__snake_case			:			List[Any]			   =   find_minimum_partitions(s)
					print(f'Minimum number of partitions required for the \'{s}\' is {ans}')





