



"""simple docstring"""







def  __SCREAMING_SNAKE_CASE (  __UpperCAmelCase = 4000000      ):

		if n <= 1:
				return 0
		_lowercase				: Tuple     =   0
		_lowercase				: int     =   2
		_lowercase				: List[Any]     =   0
		while 4 * b + a <= n:
				_lowercase     ,  _lowercase				: Union[str, Any]     =   b, 4 * b + a
				count += a
		return count + b


if __name__ == "__main__":
		print(F'{solution() = }')




UpperCAmelCase				 =   {
    0: """underwear""",
    1: """pants""",
    2: """belt""",
    3: """suit""",
    4: """shoe""",
    5: """socks""",
    6: """shirt""",
    7: """tie""",
    8: """watch""",
}

UpperCAmelCase				 =   [[1, 4], [2, 4], [3], [], [], [4], [2, 7], [3], []]

UpperCAmelCase				 =   [0 for x in range(len(graph))]
UpperCAmelCase				 =   []







def 						UpperCAmelCase							(		lowerCAmelCase_    ,   lowerCAmelCase_							)						->						List[Any]:
     a	:     Tuple						      =    1
     while stack:
          a	:     Optional[Any]						      =    stack.pop()
          print(lowerCAmelCase_    ,   clothes[current_clothing]							)
          order += 1







def 						UpperCAmelCase							(		lowerCAmelCase_    ,   lowerCAmelCase_    ,   lowerCAmelCase_							)						->						Any:
     a	:     Union[str, Any]						      =    1
     for v in graph[u]:
          if not visited[v]:
               depth_first_search(lowerCAmelCase_    ,   lowerCAmelCase_    ,   lowerCAmelCase_							)

     stack.append(lowerCAmelCase_							)







def 						UpperCAmelCase							(		lowerCAmelCase_    ,   lowerCAmelCase_							)						->						Optional[Any]:
     for v in range(len(lowerCAmelCase_							)							):
          if not visited[v]:
               depth_first_search(lowerCAmelCase_    ,   lowerCAmelCase_    ,   lowerCAmelCase_							)


if __name__ == "__main__":
  topological_sort(graph, visited)
  print(stack)
  print_stack(stack, clothes)