




'''simple docstring'''



from queue import Queue
def  SCREAMING_SNAKE_CASE_ (							__A				: str  ) -> int:
   _SCREAMING_SNAKE_CASE       =      Queue()
   _SCREAMING_SNAKE_CASE       =      [False] * len(lowercase_  )
   _SCREAMING_SNAKE_CASE       =      [-1] * len(lowercase_  )

   def bfs():
      while not queue.empty():
         _SCREAMING_SNAKE_CASE       =      queue.get()
         _SCREAMING_SNAKE_CASE       =      True

         for neighbour in graph[u]:
            if neighbour == u:
               return False

            if color[neighbour] == -1:
               _SCREAMING_SNAKE_CASE       =      1 - color[u]
               queue.put(lowercase_  )

            elif color[neighbour] == color[u]:
               return False

      return True

   for i in range(len(lowercase_  )  ):
      if not visited[i]:
         queue.put(lowercase_  )
         _SCREAMING_SNAKE_CASE       =      0
         if bfs() is False:
            return False

   return True


if __name__ == "__main__":
 # Adjacency List of graph
 print(check_bipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))







'''simple docstring'''







from __future__ import annotations

_lowerCamelCase							:						Union[str, Any]								=  {1: 1}






def 		_lowercase		(	lowercase_  ):



		'''simple docstring'''







		if n in COLLATZ_SEQUENCE_LENGTHS:
				return COLLATZ_SEQUENCE_LENGTHS[n]
		_snake_case	       =       n // 2 if n % 2 == 0 else 3 * n + 1
		_snake_case	       =       collatz_sequence_length(lowercase_  ) + 1
		_snake_case	       =       sequence_length
		return sequence_length






def 		_lowercase		(	lowercase_ = 1000000  ):



		'''simple docstring'''







		_snake_case	       =       max((collatz_sequence_length(lowercase_  ), i) for i in range(1						,							lowercase_  )  )
		return result[1]


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





