



"""simple docstring"""







from __future__ import annotations

def       _lowerCamelCase				(							UpperCAmelCase_ :       int | str     )	-> bool:






	"""simple docstring"""





	A__											=					str(UpperCAmelCase_     )
	return n == n[::-1]

def       _lowerCamelCase				(							UpperCAmelCase_ :       int = 1000000     )	-> Dict:






	"""simple docstring"""





	A__											=					0

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


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









"""simple docstring"""







def       _lowerCamelCase				(							UpperCAmelCase_ :       Optional[Any]     )	-> Dict:






	"""simple docstring"""





	A__											=					[]
	A__											=					set({"(", "[", "{"}     )
	A__											=					set({")", "]", "}"}     )
	A__											=					{"{": "}", "[": "]", "(": ")"}

	for i in range(len(UpperCAmelCase_     )     ):
		if s[i] in open_brackets:
			stack.append(s[i]     )

		elif s[i] in closed_brackets and (
		    len(UpperCAmelCase_     ) == 0 or (len(UpperCAmelCase_     ) > 0 and open_to_closed[stack.pop()] != s[i])
		):
			return False

	return len(UpperCAmelCase_     ) == 0

def       _lowerCamelCase				(							)	-> str:






	"""simple docstring"""





	A__											=					input("Enter sequence of brackets: "     )
	if is_balanced(UpperCAmelCase_     ):
		print(UpperCAmelCase_,	"is balanced"     )
	else:
		print(UpperCAmelCase_,	"is not balanced"     )


if __name__ == "__main__":
			main()




