def minumumSwap(num: int) -> int:
    n = num
    num = list(str(num))
    rightmost = [-1]*10
    for i in range(len(num)):
        rightmost[ord(num[i]) - ord('0')] = i
    for i in range(len(num)):
        for j in range(0, int(num[i])):
            if rightmost[j] > i:
                if i == 0 and j == 0:
                   continue
                num[i], num[rightmost[j]] = num[rightmost[j]], num[i]
                return int("".join(num))
    return n