
'''simple docstring'''





def   A			(							A_				:       int							):
						return n * (2 * n - 1)

def   A			(							A_				:       int							):
						snake_case							:  Optional[Any]			=     (1 + 24 * n) ** 0.5
						return ((1 + root) / 6) % 1 == 0

def   A			(							A_				:       int = 144							):
						snake_case							:  Any			=     start
						snake_case							:  Any			=     hexagonal_num(A_							)
						while not is_pentagonal(A_							):
												n += 1
												snake_case							:  Optional[Any]			=     hexagonal_num(A_							)
						return num


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






"""simple docstring"""






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

_lowercase					:					Dict 		=		[[1, 4], [2, 4], [3], [], [], [4], [2, 7], [3], []]

_lowercase					:					Union[str, Any] 		=		[0 for x in range(len(graph))]
_lowercase					:					Union[str, Any] 		=		[]






def 	snake_case__  (						__lowerCamelCase							:       Optional[int]				,						__lowerCamelCase							:       Dict      ):
			"""simple docstring"""
			lowerCamelCase__						:						int						      =1
			while stack:
						lowerCamelCase__						:						int						      =stack.pop()
						print(__lowerCamelCase				,						clothes[current_clothing]      )
						order += 1






def 	snake_case__  (						__lowerCamelCase							:       Optional[Any]				,						__lowerCamelCase							:       str				,						__lowerCamelCase							:       Tuple      ):
			"""simple docstring"""
			lowerCamelCase__						:						Dict						      =1
			for v in graph[u]:
						if not visited[v]:
									depth_first_search(__lowerCamelCase				,						__lowerCamelCase				,						__lowerCamelCase      )

			stack.append(__lowerCamelCase      )






def 	snake_case__  (						__lowerCamelCase							:       Optional[Any]				,						__lowerCamelCase							:       Optional[Any]      ):
			"""simple docstring"""
			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)




