

"""simple docstring"""






import math
def  UpperCamelCase   (     _lowerCAmelCase       :  Union[str, Any]	)			->     Optional[Any]:
	_UpperCAmelCase      :							Optional[int]       =   0
	if n % 2 == 0:
		count += 1
		while n % 2 == 0:
			_UpperCAmelCase      :							Any       =   int(n / 2	)
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

	_UpperCAmelCase      :							Dict       =   3

	while i <= int(math.sqrt(_lowerCAmelCase	)	):
		if n % i == 0:
			count += 1
			while n % i == 0:
				_UpperCAmelCase      :							List[Any]       =   int(n / i	)
		_UpperCAmelCase      :							Optional[Any]       =   i + 2

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

	if n > 2:
		count += 1
	return count


if __name__ == "__main__":
						lowerCamelCase__			:					Union[str, Any]							  =					51_24_21_83
						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  UpperCamelCase   (     _lowerCAmelCase       :  int	)			->     str:
	_UpperCAmelCase      :							Any       =   len(_lowerCAmelCase	)
	for _ in range(
	    0,					int(((no_of_elements - 1) / 2) + 1	)	):  # we don't need to traverse to end of list as
		for j in range(0,					no_of_elements - 1	):
			if (
			    lst[j + 1] < lst[j]
			):  # applying bubble sort algorithm from left to right (or forwards)
				_UpperCAmelCase      :							List[str]       =   lst[j + 1]
				_UpperCAmelCase      :							Optional[int]       =   lst[j]
				_UpperCAmelCase      :							Optional[int]       =   temp
			if (
			    lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
			):  # applying bubble sort algorithm from right to left (or backwards)
				_UpperCAmelCase      :							Any       =   lst[no_of_elements - 1 - j]
				_UpperCAmelCase      :							Optional[Any]       =   lst[no_of_elements - 2 - j]
				_UpperCAmelCase      :							Optional[Any]       =   temp
	return lst


if __name__ == "__main__":
						print('''enter the list to be sorted''')
						lowerCamelCase__			:					List[str]							  =					[int(x) for x in input().split()]  # inputing elements of the list in one line
						lowerCamelCase__			:					int							  =					double_sort(lst)
						print('''the sorted list is''')
						print(sorted_lst)





