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)
import math







def 						UpperCAmelCase							(		lowerCAmelCase_							)						->						int:
     return sum(int(lowerCAmelCase_							) for digit in str(lowerCAmelCase_							)							)







def 						UpperCAmelCase							(		lowerCAmelCase_ = 3_0							)						->						int:
     a	:     Optional[int]						      =    []
     for digit in range(2    ,   1_0_0							):
          for power in range(2    ,   1_0_0							):
               a	:     List[str]						      =    int(math.pow(lowerCAmelCase_    ,   lowerCAmelCase_							)							)
               if digit == digit_sum(lowerCAmelCase_							):
                    digit_to_powers.append(lowerCAmelCase_							)

     digit_to_powers.sort()
     return digit_to_powers[n - 1]


if __name__ == "__main__":
  print(solution())