





'''simple docstring'''







_a					: Dict      =    1_0**8





def    _lowerCAmelCase						(						lowercase	)					->					bool:
			if n % 10 == 0:
						return False
			__lowerCAmelCase											=				str(lowercase	)
			return s == s[::-1]





def    _lowerCAmelCase						(						)					->					int:
			__lowerCAmelCase											=				set()
			__lowerCAmelCase											=				1
			__lowerCAmelCase											=				5
			while sum_squares < LIMIT:
						__lowerCAmelCase											=				first_square + 1
						while sum_squares < LIMIT:
									if is_palindrome(lowercase	):
												answer.add(lowercase	)
									last_square += 1
									sum_squares += last_square**2
						first_square += 1
						__lowerCAmelCase											=				first_square**2 + (first_square + 1) ** 2

			return sum(lowercase	)


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








'''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}')

