






"""simple docstring"""





from __future__ import annotations



def   a    (     __UpperCAmelCase      :    int | str  )    ->							bool:
						__magic_name__:	List[str]							=       str(__UpperCAmelCase  )
						return n == n[::-1]



def   a    (     __UpperCAmelCase      :    int = 1_0_0_0_0_0_0  )    ->							Tuple:
						__magic_name__:	int							=       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"""





from __future__ import annotations



def   a    (     __UpperCAmelCase      :    list  )    ->							list:
						if len(__UpperCAmelCase  ) == 0:
												return []
						__magic_name__,			__magic_name__:	List[str]							=       min(__UpperCAmelCase  ), max(__UpperCAmelCase  )
						__magic_name__:	Optional[int]							=       int(max_value - min_value  ) + 1
						__magic_name__:	list[list]							=       [[] for _ in range(__UpperCAmelCase  )]

						for i in my_list:
												buckets[int(i - min_value  )].append(__UpperCAmelCase  )

						return [v for bucket in buckets for v in sorted(__UpperCAmelCase  )]


if __name__ == "__main__":
							from doctest import testmod

							testmod()
							assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
							assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]



