import sys, math, itertools, functools, collections
input = sys.stdin.readline

def solve(testcase):
    s = input().strip()
    l = [0 if i == 'S' else 1 if i == 'R' else 2 for i in s]
    n = len(l)
    dp = [[[10**9, 10**9, 10**9], [10**9, 10**9, 10**9], [10**9, 10**9, 10**9]] for i in range(n)]
    dp[0][l[0]][l[0]] = 0
    dp[0][(l[0]+1)%3][(l[0]+1)%3] = 1
    dp[0][(l[0]+2)%3][(l[0]+2)%3] = 1
    for i in range(1, n):
        for j in range(3): # first character
            for cur in range(3):
                best = 10**9
                for bef in range(3):
                    if bef != cur and (i != n-1 or cur != j):
                        best = min(best, dp[i-1][j][bef] + (cur != l[i]))
                dp[i][j][cur] = best

    print('Case #'+str(testcase)+':', min(dp[n-1][i][j] for i in range(3) for j in range(3)))


for testcase in range(1, int(input())+1):
    solve(testcase)