You are given an $n \times n$ binary grid board. In each move, you can swap any two rows or any two columns.

Return the minimum number of moves required to transform the grid into a valid chessboard. If it is impossible to transform the grid into a chessboard, return $-1$.

A valid chessboard is a grid where no two horizontally or vertically adjacent cells contain the same value.

Constraints:

• n $==$ board.length

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

• $2 \leq$ n $\leq 30$

• board[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.