

from __future__ import annotations






def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__      )  ->					bool:
	__lowerCamelCase    :    List[Any] 	=			str(lowerCamelCase__      )
	return n == n[::-1]






def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__ = 1_0_0_0_0_0_0      )  ->					Any:
	__lowerCamelCase    :    Union[str, Any] 	=			0

	for i in range(1     ,			lowerCamelCase__      ):
		if is_palindrome(lowerCamelCase__      ) and is_palindrome(bin(lowerCamelCase__      ).split('b'      )[1]      ):
			total += i
	return total


if __name__ == "__main__":
					print(solution(int(str(input().strip()))))







from __future__ import annotations






def        SCREAMING_SNAKE_CASE__	(  lowerCamelCase__     ,			lowerCamelCase__      )  ->					bool:
	if len(lowerCamelCase__      ) == 0:
		return False
	__lowerCamelCase    :    List[Any] 	=			len(lowerCamelCase__      ) // 2
	if a_list[midpoint] == item:
		return True
	if item < a_list[midpoint]:
		return binary_search(a_list[:midpoint]     ,			lowerCamelCase__      )
	else:
		return binary_search(a_list[midpoint + 1 :]     ,			lowerCamelCase__      )


if __name__ == "__main__":
					a		=input("""Enter numbers separated by comma:\n""").strip()
					a		=[int(item.strip()) for item in user_input.split(""",""")]
					a		=int(input("""Enter the number to be found in the list:\n""").strip())
					a		="""""" if binary_search(sequence, target) else """not """
					print(F"""{target} was {not_str}found in {sequence}""")




