


'''simple docstring'''






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


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



'''simple docstring'''






def 					_snake_case   (     A       )						->    str:
							return " ".join(sorted(set(sentence.split()       )       )       )


if __name__ == "__main__":
		import doctest

		doctest.testmod()