Python Solution
\n\n# Code\npython3 []\nclass Solution:\n    def maxMatrixSum(self, matrix: List[List[int]]) -> int:\n        \n        n = len(matrix)\n\n        s = 0\n\n    
\n\n# Code\n```python3 []\nclass Solution:\n    def maxMatrixSum(self, matrix: List[List[int]]) -> int:\n        \n        n = len(matrix)\n\n        s = 0\n\n        minimum = float("inf")\n\n        counter = 0\n\n        for r in matrix:\n            for v in r:\n\n                s += abs(v)\n\n                if v < 0:\n                    counter += 1\n\n                minimum = min(minimum, abs(v))\n            \n        if counter % 2 == 0:\n            return s\n        return s - 2*minimum\n        \n```
['Array', 'Greedy', 'Matrix', 'Python3']