






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


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







'''simple docstring'''







def    _lowerCAmelCase						(						lowercase	)					->					int:
			__lowerCAmelCase											=				len(lowercase	)
			__lowerCAmelCase											=				[0] * length
			__lowerCAmelCase											=				[[False for i in range(lowercase	)] for j in range(lowercase	)]
			for i, c in enumerate(lowercase	):
						__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(lowercase					,	0 if j == 0 else (cut[j - 1] + 1)	)
						__lowerCAmelCase											=				mincut
			return cut[length - 1]


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

