



def snake_case__  (			__SCREAMING_SNAKE_CASE )		->							list:
		UpperCAmelCase_						=				int(__SCREAMING_SNAKE_CASE )
		if n_element < 1:
				UpperCAmelCase_						=				ValueError("a should be a positive number" )
				raise my_error

		UpperCAmelCase_						=				[1]
		UpperCAmelCase_					,						UpperCAmelCase_					,						UpperCAmelCase_						=				(0, 0, 0)
		UpperCAmelCase_						=				1
		while index < n_element:
				while hamming_list[i] * 2 <= hamming_list[-1]:
						i += 1
				while hamming_list[j] * 3 <= hamming_list[-1]:
						j += 1
				while hamming_list[k] * 5 <= hamming_list[-1]:
						k += 1
				hamming_list.append(
				    min(hamming_list[i] * 2			,     hamming_list[j] * 3			,     hamming_list[k] * 5 ) )
				index += 1
		return hamming_list


if __name__ == "__main__":
			SCREAMING_SNAKE_CASE     				=						input("Enter the last number (nth term) of the Hamming Number Series: ")
			print("Formula of Hamming Number Series => 2^i * 3^j * 5^k")
			SCREAMING_SNAKE_CASE     				=						hamming(int(n))
			print("-----------------------------------------------------")
			print(f'''The list with nth numbers is: {hamming_numbers}''')
			print("-----------------------------------------------------")






def snake_case__  (			__SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE )		->							Union[str, Any]:
		UpperCAmelCase_						=				0
		while b > 0:
				if b & 1:
						res += a

				a += a
				b >>= 1

		return res







def snake_case__  (			__SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE )		->							Tuple:
		UpperCAmelCase_						=				0
		while b > 0:
				if b & 1:
						UpperCAmelCase_						=				((res % c) + (a % c)) % c

				a += a
				b >>= 1

		return res

