import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
import string
S = string.ascii_uppercase
def solve(test):
    s = [0 if v == 'R' else 1 if v == 'S' else 2 for v in input()]
    n = len(s)
    ans = 0
    now = s[0]
    C = []
    cnt = 0
    for i in range(n):
        if now == s[i]:
            cnt += 1
        else:
            C.append(cnt)
            cnt = 1
            now = s[i]
    ans = 0
    if len(C) == 0 or s[0] != s[-1]:
        C.append(cnt)
    else:
        C[0] += cnt
    for v in C:
        ans += v // 2
    if len(C) == 1:
        ans = (C[0] + 1) // 2

    print('Case #' + str(test) + ':', ans)




for test in range(1, ii() + 1):
    solve(test)