



'''simple docstring'''






def        snake_case_   (	lowerCAmelCase_ = 100			,  lowerCAmelCase_ = 100						)->						int:





       '''simple docstring'''


       return max(
           sum(int(lowerCAmelCase_						) for x in str(base**power						)						)
           for base in range(lowerCAmelCase_						)
           for power in range(lowerCAmelCase_						)						)


# Tests
if __name__ == "__main__":
   import doctest

   doctest.testmod()








import heapq







def  _snake_case			(							__snake_case       ,	__snake_case       ,	__snake_case     )  ->  str:






      '''simple docstring'''







      UpperCAmelCase_	:						List[str]					   =		[(0, start)]  # cost from start node,end node
      UpperCAmelCase_	:						List[Any]					   =		set()
      while heap:
            ((UpperCAmelCase_)   ,   (UpperCAmelCase_))	:						str					   =		heapq.heappop(__snake_case     )
            if u in visited:
                  continue
            visited.add(__snake_case     )
            if u == end:
                  return cost
            for v, c in graph[u]:
                  if v in visited:
                        continue
                  UpperCAmelCase_	:						Tuple					   =		cost + c
                  heapq.heappush(__snake_case       ,	(next_item, v)     )
      return -1


__lowerCamelCase								=      {
    '''A''': [['''B''', 2], ['''C''', 5]],
    '''B''': [['''A''', 2], ['''D''', 3], ['''E''', 1], ['''F''', 1]],
    '''C''': [['''A''', 5], ['''F''', 3]],
    '''D''': [['''B''', 3]],
    '''E''': [['''B''', 4], ['''F''', 3]],
    '''F''': [['''C''', 3], ['''E''', 3]],
}
__lowerCamelCase								=      {
    '''B''': [['''C''', 1]],
    '''C''': [['''D''', 1]],
    '''D''': [['''F''', 1]],
    '''E''': [['''B''', 1], ['''F''', 3]],
    '''F''': [],
}
__lowerCamelCase								=      {
    '''B''': [['''C''', 1]],
    '''C''': [['''D''', 1]],
    '''D''': [['''F''', 1]],
    '''E''': [['''B''', 1], ['''G''', 2]],
    '''F''': [],
    '''G''': [['''F''', 1]],
}

__lowerCamelCase								=      dijkstra(G, '''E''', '''C''')
print(short_distance)  # E -- 3 --> F -- 3 --> C == 6

__lowerCamelCase								=      dijkstra(Ga, '''E''', '''F''')
print(short_distance)  # E -- 3 --> F == 3

__lowerCamelCase								=      dijkstra(Ga, '''E''', '''F''')
print(short_distance)  # E -- 2 --> G -- 1 --> F == 3

if __name__ == "__main__":
   import doctest

   doctest.testmod()
