Python (Simple Maths)
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:\n    def maximumGood(self,statements):\n        n, max_val = len(statements), 0\n\n        def function(guessedTypes,statements):\n            for i in range(n):\n                if guessedTypes[i] == 1:\n                    for j in range(n):\n                        if statements[i][j] != 2 and statements[i][j] != guessedTypes[j]:\n                            return False\n\n            return True\n\n        for i in range(1<<n):\n            guessedTypes = [int(x) for x in bin(i)[2:].zfill(n)]\n            if function(guessedTypes,statements):\n                max_val = max(max_val,sum(guessedTypes))\n\n        return max_val \n```
['Python3']