
def 			UpperCamelCase       (				lowerCAmelCase__ = 10**6						):
					'''simple docstring'''






					if n <= 0:
										raise ValueError('''Please enter an integer greater than 0'''						)

					lowercase		      =		list(range(n + 1						)						)
					for number in range(2					,     n + 1						):
										if phi[number] == number:
															phi[number] -= 1
															for multiple in range(number * 2					,     n + 1					,     lowerCAmelCase__						):
																				lowercase		      =		(phi[multiple] // number) * (number - 1)

					lowercase		      =		1
					for number in range(1					,     n + 1						):
										if (answer / phi[answer]) < (number / phi[number]):
															lowercase		      =		number

					return answer


if __name__ == "__main__":
							print(solution())








def 			__SCREAMING_SNAKE_CASE		(		UpperCamelCase		:      str	)     ->	int:



	"""simple docstring"""






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


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