You are given a $0$-indexed n x n grid where n is odd, and each cell grid[r][c] contains a value of $0$, $1$, or $2$.

A cell is considered part of the Letter Y if it belongs to any of the following segments:

• The diagonal starting at the top-left cell and ending at the center cell of the grid.

• The diagonal starting at the top-right cell and ending at the center cell of the grid.

• The vertical line starting at the center cell and ending at the bottom border of the grid.

The Letter Y is considered written on the grid if and only if:

• All cells belonging to Y share the same value.

• All cells not belonging to Y share the same value.

• The value of Y cells is different from the value of non-Y cells.

In one operation, you may change the value of any cell to $0$, $1$, or $2$. Return the minimum number of operations required to write the Letter Y on the grid.

Constraints:

• $3 \leq$ n $\leq 49$

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

• $0 \leq$ grid[i][j] $\leq 2$

• n is odd

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.