


def 			lowerCAmelCase__					(     a__:						int			)    ->						int:


							'''simple docstring'''





							if a < 0:
														raise ValueError('Input value must be a positive integer'			)
							elif isinstance(a__     ,    a__			):
														raise TypeError('Input value must be a \'int\' type'			)
							return bin(a__			).count('1'			)


if __name__ == "__main__":
		import doctest

		doctest.testmod()




def 			lowerCAmelCase__					(     a__:						int     ,    a__:						int			)    ->						int:


							'''simple docstring'''





							return x if y == 0 else greatest_common_divisor(a__     ,    x % y			)

def 			lowerCAmelCase__					(     a__:						int     ,    a__:						int			)    ->						int:


							'''simple docstring'''





							return (x * y) // greatest_common_divisor(a__     ,    a__			)

def 			lowerCAmelCase__					(     a__:						int = 2_0			)    ->						int:


							'''simple docstring'''





							_UpperCAmelCase											=     1
							for i in range(1     ,    n + 1			):
														_UpperCAmelCase											=     lcm(a__     ,    a__			)
							return g


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