An $n \times n$ grid is composed of $n$, $1 \times 1$ squares, where each $1 \times 1$ square consists of a “/”, “\”, or a blank space. These characters divide the square into adjacent regions.

Given the grid represented as a string array, return the number of adjacent regions.

Note:

1. Backslash characters are escaped, so “\” is represented as “\\”.
2. A $1 \times 1$ square in the grid will be referred to as a box.

Constraints:

• The grid consists of only the “/”, “\”, or " " characters.
• 1 $\leq$ grid.length $\leq$ 30

The following illustration shows how the grid can be visualized:

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:

Implement your solution in main.py in the following coding playground. You will need the provided supporting code to implement your solution.