You are given a string corridor of length n representing a corridor layout, where each character is either 'S' representing a seat or 'P' representing a plant.

You want to install dividers to divide the corridor into adjacent sections such that each section contains exactly $2$ seats and any number of plants. Dividers can only be placed between adjacent positions in the corridor. Two ways of dividing the corridor are considered different if there is a position with a divider in one way and not in the other.

Return the number of ways to divide the corridor. Since the answer may be large, return it modulo $10^9 + 7$. If there is no valid way to divide the corridor, return $0$.

Constraints:

• n == corridor.length

• $1 \leq n \leq 10^5$

• corridor[i] is either 'S' or 'P'.

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.