





def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__						):
		if not isinstance(lowerCAmelCase__							,lowerCAmelCase__						) or number < 0:
				raise ValueError('Input must be a non-negative integer'						)

		lowerCamelCase_	:     int 						=      0
		while number:
				# This way we arrive at next set bit (next 1) instead of looping
				# through each bit and checking for 1s hence the
				# loop won't run 32 times it will only run the number of `1` times
				number &= number - 1
				count += 1
		return count


if __name__ == "__main__":
		import doctest

		doctest.testmod()







_lowercase		:  Any			       =[0, 2, 4, 6, 8]
_lowercase		:  List[Any]			       =[1, 3, 5, 7, 9]


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__							,lowerCAmelCase__							,lowerCAmelCase__							,lowerCAmelCase__						):
		if remaining_length == 0:
				if digits[0] == 0 or digits[-1] == 0:
						return 0

				for i in range(length // 2 - 1							,-1							,-1						):
						remainder += digits[i] + digits[length - i - 1]

						if remainder % 2 == 0:
								return 0

						remainder //= 10

				return 1

		if remaining_length == 1:
				if remainder % 2 == 0:
						return 0

				lowerCamelCase_	:     Dict 						=      0
				for digit in range(10						):
						lowerCamelCase_	:     List[Any] 						=      digit
						result += reversible_numbers(
						    0							,(remainder + 2 * digit) // 10							,lowerCAmelCase__							,lowerCAmelCase__						)
				return result

		lowerCamelCase_	:     List[str] 						=      0
		for digita in range(10						):
				lowerCamelCase_	:     Tuple 						=      digita

				if (remainder + digita) % 2 == 0:
						lowerCamelCase_	:     Dict 						=      ODD_DIGITS
				else:
						lowerCamelCase_	:     str 						=      EVEN_DIGITS

				for digita in other_parity_digits:
						lowerCamelCase_	:     Optional[int] 						=      digita
						result += reversible_numbers(
						    remaining_length - 2							,(remainder + digita + digita) // 10							,lowerCAmelCase__							,lowerCAmelCase__							,)
		return result


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__ = 9						):
		lowerCamelCase_	:     int 						=      0
		for length in range(1							,max_power + 1						):
				result += reversible_numbers(lowerCAmelCase__							,0							,[0] * length							,lowerCAmelCase__						)
		return result


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