



from __future__ import annotations

def      __lowercase(						UpperCAmelCase__			):


      """simple docstring"""



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

def      __lowercase(						UpperCAmelCase__ = 1000000			):


      """simple docstring"""



      lowerCamelCase             =		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()))))

from __future__ import annotations

def  __snake_case							(	__magic_name__						):







				'''simple docstring'''


				if len(__magic_name__						) == 0:
								return []
				lowercase     ,	lowercase         =      min(__magic_name__						), max(__magic_name__						)
				lowercase         =      int(max_value - min_value						) + 1
				lowercase         =      [[] for _ in range(__magic_name__						)]

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

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


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]
