from sys import stdin
input = stdin.readline
GI = lambda: int(input())
gi = lambda: list(map(int, input().split()))
T = GI()
def help(S, N, offset):
    memo = [10**9] * 9
    for i in range(9):
        now, end = i // 3, i % 3
        if now == end: continue
        memo[i] = S[offset] != now
    for ind in range(1, N):
        ch = S[(ind + offset) % N]
        nxt = [10**9] * 9
        for end in 0,1,2:
            for cur in 0,1,2:
                for prev in 0,1,2:
                    if prev == cur: continue
                    nxt[cur*3+end] = min(nxt[cur*3+end], memo[prev*3+end] + (cur != ch))
        memo = nxt[:]
    return min(memo[i] for i in range(9) if i % 3 == i // 3)

def solve(id):
    S = list(map("RPS".find, input().strip()))
    best = 10**9
    for offset in range(len(S)):
        best = min(best, help(S, len(S), offset))
        if best != 10**9: break
    return best
for i in range(1, T + 1):
    print("Case #%d: %s" % (i, solve(i)))