






from __future__ import annotations







def     a_   (__A      )				->						bool:



					"""simple docstring"""
					__a					:						Dict      =					str(__A      )
					return n == n[::-1]







def     a_   (__A = 1_000_000      )				->						int:



					"""simple docstring"""
					__a					:						Tuple      =					0

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


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













def     a_   (__A				,       __A				,       __A				,       __A      )				->						int:



					"""simple docstring"""
					__a      ,			__a					:						Any      =					len(__A      ), len(grid[0]      )
					if (
					    min(__A				,       __A      ) < 0
					    or row == row_length
					    or col == col_length
					    or (row, col) in visit
					    or grid[row][col] == 1
					):
										return 0
					if row == row_length - 1 and col == col_length - 1:
										return 1

					visit.add((row, col)      )

					__a					:						Dict      =					0
					count += depth_first_search(__A				,       row + 1				,       __A				,       __A      )
					count += depth_first_search(__A				,       row - 1				,       __A				,       __A      )
					count += depth_first_search(__A				,       __A				,       col + 1				,       __A      )
					count += depth_first_search(__A				,       __A				,       col - 1				,       __A      )

					visit.remove((row, col)      )
					return count


if __name__ == "__main__":
			import doctest

			doctest.testmod()





