'''simple docstring'''





def      a__ (		__UpperCamelCase				):
      SCREAMING_SNAKE_CASE_          =  [0] * len(__UpperCamelCase				)
      SCREAMING_SNAKE_CASE_          =  []
      SCREAMING_SNAKE_CASE_          =  []
      SCREAMING_SNAKE_CASE_          =  0

      for values in graph.values():
            for i in values:
                  indegree[i] += 1

      for i in range(len(__UpperCamelCase				)				):
            if indegree[i] == 0:
                  queue.append(__UpperCamelCase				)

      while queue:
            SCREAMING_SNAKE_CASE_          =  queue.pop(0				)
            cnt += 1
            topo.append(__UpperCamelCase				)
            for x in graph[vertex]:
                  indegree[x] -= 1
                  if indegree[x] == 0:
                        queue.append(__UpperCamelCase				)

      if cnt != len(__UpperCamelCase				):
            print("Cycle exists"				)
      else:
            print(__UpperCamelCase				)


# Adjacency List of Graph
A     :  Any					     =       {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}





topological_sort(graph)



from __future__ import annotations


def      a__ (		__UpperCamelCase				):
      SCREAMING_SNAKE_CASE_          =  str(__UpperCamelCase				)
      return n == n[::-1]


def      a__ (		__UpperCamelCase = 1_0_0_0_0_0_0				):
      SCREAMING_SNAKE_CASE_          =  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()))))


