Number of Ways to Divide a Long Corridor

class Solution:
    def numberOfWays(self, corridor: str) -> int:
        res = 1
        cnt = 0
        temp = 1
        for i in corridor:
            if cnt == 2 and i == 'P':
                temp += 1
            elif cnt == 2 and i == 'S':
                res *= temp
                temp = 1
                cnt = 1
            else:
                cnt += int(i=='S')
        if cnt == 2:
            return res%int(1e9+7)
        return 0