





'''simple docstring'''







import math





def    _lowerCAmelCase						(						lowercase	)					->					Tuple:
			__lowerCAmelCase											=				0
			if n % 2 == 0:
						count += 1
						while n % 2 == 0:
									__lowerCAmelCase											=				int(n / 2	)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

			__lowerCAmelCase											=				3

			while i <= int(math.sqrt(lowercase	)	):
						if n % i == 0:
									count += 1
									while n % i == 0:
												__lowerCAmelCase											=				int(n / i	)
						__lowerCAmelCase											=				i + 2

			# this condition checks the prime
			# number n is greater than 2

			if n > 2:
						count += 1
			return count


if __name__ == "__main__":
	_a					: List[Any]      =    5_1_2_4_2_1_8_3
	print(f'The number of distinct prime factors is/are {exact_prime_factor_count(n)}')
	print(f'The value of log(log(n)) is {math.log(math.log(n)):.4f}')








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

