easiest way PYTHON
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minimumSum(self, num: int) -> int:\n\n        num=str(num)\n        num=list(num)\n        num.sort()\n        a=num[0]+num[2]\n        b=num[1]+num[3]\n        \n        return int(a) + int(b)\n\n```
['Python3']