



import math



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

					UpperCamelCase_			= 3

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

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

					if n > 2:
										count += 1
					return count


if __name__ == "__main__":
	UpperCAmelCase :				List[Any]							=5124_2183
	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}")




from string import ascii_uppercase



def      __lowerCAmelCase    (				snake_case						:     str    ,   snake_case						:     str    ,   snake_case						:     bool = False    ,   snake_case						:     str = ascii_uppercase			)							->				str:
   __lowerCamelCase:					List[str]	 =						keyword.upper()
   __lowerCamelCase:					Tuple	 =						plaintext.upper()
   __lowerCamelCase:					Optional[Any]	 =						set(snake_case			)

   # create a list of unique characters in the keyword - their order matters
   # it determines how we will map plaintext characters to the ciphertext
   __lowerCamelCase:					Tuple	 =						[]
   for char in keyword:
      if char in alphabet_set and char not in unique_chars:
         unique_chars.append(snake_case			)
    # the number of those unique characters will determine the number of rows
   __lowerCamelCase:					Tuple	 =						len(snake_case			)

   # create a shifted version of the alphabet
   __lowerCamelCase:					List[str]	 =						unique_chars + [
       char for char in alphabet if char not in unique_chars
   ]

   # create a modified alphabet by splitting the shifted alphabet into rows
   __lowerCamelCase:					List[str]	 =						[
       shifted_alphabet[k : k + num_unique_chars_in_keyword]
       for k in range(0    ,   26    ,   snake_case			)
   ]

   # map the alphabet characters to the modified alphabet characters
   # going 'vertically' through the modified alphabet - consider columns first
   __lowerCamelCase:					Union[str, Any]	 =						{}
   __lowerCamelCase:					str	 =						0
   for column in range(snake_case			):
      for row in modified_alphabet:
         # if current row (the last one) is too short, break out of loop
         if len(snake_case			) <= column:
            break

         # map current letter to letter in modified alphabet
         __lowerCamelCase:					Union[str, Any]	 =						row[column]
         letter_index += 1

   if verbose:
      print(snake_case			)
   # create the encrypted text by mapping the plaintext to the modified alphabet
   return "".join(mapping[char] if char in mapping else char for char in plaintext			)


if __name__ == "__main__":
   # example use
   print(mixed_keyword('''college''', '''UNIVERSITY'''))


