import sys
input = sys.stdin.readline
from collections import deque
from bisect import bisect_left, bisect_right
import itertools
#from math import *

for t in range(1, int(input())+1):

    s = input().strip()
    n = len(s)
    ans = 10000000000000
    #P
    dp = [[1000000000000]*3 for _ in range(n)]
    dp[0][0] = 0 if s[0] == 'P' else 1
    for i in range(1, n):
        dp[i][0] = min(dp[i-1][1], dp[i-1][2])+(0 if s[i] == 'P' else 1)
        dp[i][1] = min(dp[i-1][0], dp[i-1][2])+(0 if s[i] == 'R' else 1)
        dp[i][2] = min(dp[i-1][0], dp[i-1][1])+(0 if s[i] == 'S' else 1)
    ans = min(ans, dp[-1][1], dp[-1][2])
    #R
    dp = [[1000000000000]*3 for _ in range(n)]
    dp[0][1] = 0 if s[0] == 'R' else 1
    for i in range(1, n):
        dp[i][0] = min(dp[i-1][1], dp[i-1][2])+(0 if s[i] == 'P' else 1)
        dp[i][1] = min(dp[i-1][0], dp[i-1][2])+(0 if s[i] == 'R' else 1)
        dp[i][2] = min(dp[i-1][0], dp[i-1][1])+(0 if s[i] == 'S' else 1)
    ans = min(ans, dp[-1][0], dp[-1][2])
    #S
    dp = [[1000000000000]*3 for _ in range(n)]
    dp[0][2] = 0 if s[0] == 'S' else 1
    for i in range(1, n):
        dp[i][0] = min(dp[i-1][1], dp[i-1][2])+(0 if s[i] == 'P' else 1)
        dp[i][1] = min(dp[i-1][0], dp[i-1][2])+(0 if s[i] == 'R' else 1)
        dp[i][2] = min(dp[i-1][0], dp[i-1][1])+(0 if s[i] == 'S' else 1)
    ans = min(ans, dp[-1][0], dp[-1][1])
    

    print("Case #{}: {}".format(t, ans))