




from collections import defaultdict
def        lowerCamelCase_     (     SCREAMING_SNAKE_CASE = 5 ):
			'''simple docstring'''
			SCREAMING_SNAKE_CASE     =       defaultdict(SCREAMING_SNAKE_CASE )
			SCREAMING_SNAKE_CASE     =       0

			while True:
						SCREAMING_SNAKE_CASE     =       get_digits(SCREAMING_SNAKE_CASE )
						freqs[digits].append(SCREAMING_SNAKE_CASE )

						if len(freqs[digits] ) == max_base:
									SCREAMING_SNAKE_CASE     =       freqs[digits][0] ** 3
									return base

						num += 1
def        lowerCamelCase_     (     SCREAMING_SNAKE_CASE ):
			'''simple docstring'''
			return "".join(sorted(str(num**3 ) ) )


if __name__ == "__main__":
		print(f'''{solution() = }''')












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


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






