Number of Ways to Divide a Long Corridor

Count the ways to insert dividers between characters in a string of 'S' (seats) and 'P' (plants) so every resulting section contains exactly two 'S', returning the result modulo 1e9+7. The core challenge is checking the total number of seats is even and then computing the combinatorial choices determined by the plant gaps between consecutive seat-pairs.