'''simple docstring'''







from __future__ import annotations


def    lowerCamelCase       (			UpperCAmelCase__				:  int | str		)			->	bool:


							'''simple docstring'''






							SCREAMING_SNAKE_CASE__     :Dict						    = str(UpperCAmelCase__		)
							return n == n[::-1]


def    lowerCamelCase       (			UpperCAmelCase__				:  int = 1_0_0_0_0_0_0		)			->	List[str]:


							'''simple docstring'''






							SCREAMING_SNAKE_CASE__     :Union[str, Any]						    = 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__				:  int		)			->	int:


							'''simple docstring'''






							assert (
							    isinstance(UpperCAmelCase__				,						UpperCAmelCase__		) and number_of_steps > 0
							), F'''number_of_steps needs to be positive integer, your input {number_of_steps}'''
							if number_of_steps == 1:
														return 1
							SCREAMING_SNAKE_CASE__    ,      SCREAMING_SNAKE_CASE__     :Dict						    = 1, 1
							for _ in range(number_of_steps - 1		):
														SCREAMING_SNAKE_CASE__    ,      SCREAMING_SNAKE_CASE__     :Union[str, Any]						    = current + previous, current
							return current


if __name__ == "__main__":
		import doctest

		doctest.testmod()






