class Solution: def maxProduct(self, n: int) -> int: dig = [] while n > 0: heapq.heappush(dig, -(n % 10)) n //= 10 return abs(heapq.heappop(dig) * heapq.heappop(dig))