#!/usr/bin/env python3

def solve(c):
    res = 0
    c = list(c)
    i = 0
    while i < len(c) + 1:
        if c[(i-1) % len(c)] == c[i % len(c)]:
            pos = set("RSP")
            pos.discard(c[(i-1) % len(c)])
            pos.discard(c[(i+1) % len(c)])
            c[i] = pos.pop()
            res += 1
        i += 1
    return res


def main():
    t = int(input())
    for tc in range(1, t+1):
        c = input()
        res = solve(c)
        print(f"Case #{tc}: {res}")


if __name__ == "__main__":
    main()