import fileinput
import sys

sys.setrecursionlimit(10**6)

lines = fileinput.input()

def read(conv=str, sep=None):
    global lines
    line = lines.readline().strip()
    if sep is None:
        return conv(line)
    else:
        return [conv(token) for token in line.split(sep)]

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)

candidates = {'P': 'RS', 'R': 'PS', 'S': 'PR'}

def solve0(N, C):
    i = 1
    changes = 0
    while i <= N:
        c1 = C[i-1]
        c2 = C[i]
        c3 = C[i+1]
        if c1 == c2:
            for cc in candidates[c2]:
                if cc != c3:
                    C[i] = c2 = cc
                    if i+N < len(C):
                        C[i+N] = cc
                    changes += 1
                    break
        i += 1
    return changes

def solve(C):
    changes = []
    for c in 'RPS':
        C0 = list(C)
        changes0 = 0
        if C0[0] != c:
            C0[0] = c
            changes0 += 1
        changes0 += solve0(len(C0), C0 + C0[:2])
        changes.append(changes0)
    return min(changes)

T = read(int)
for t in range(T):
    C = read()
    sol = solve(C)
    print("Case #{0}:".format(t + 1), sol)