very simple solution
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```python3 []\nclass Solution(object):\n    def maxMatrixSum(self, matrix):\n        """\n        :type matrix: List[List[int]]\n        :rtype: int\n        """\n        min_value = float(\'inf\')  # Equivalent to Integer.MAX_VALUE\n        total_sum = 0\n        neg_count = 0\n\n        for row in matrix:\n            for value in row:\n                if value < 0:\n                    neg_count += 1\n                abs_value = abs(value)\n                min_value = min(min_value, abs_value)\n                total_sum += abs_value\n\n        if neg_count % 2 == 0:\n            return total_sum\n        return total_sum - 2 * min_value\n```
['Python3']