You are given an m by n binary matrix grid.

A move consists of selecting any row or column and toggling every value in it, changing all $0$’s to $1$’s and all $1$’s to $0$’s.

Each row of the matrix represents a binary number. The score of the matrix is defined as the sum of these binary numbers across all rows.

Return the maximum possible score achievable after performing any number of moves.

Constraints:

• m $==$ grid.length

• n $==$ grid[i].length

• $1 \leq$ m, n $\leq 20$

• grid[i][j] is either $0$ or $1$.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.