MOD = 10**9 + 7

def solve(S):
    n = len(S)
    dp = [0] * (n + 1)
    dp[0] = 1
    for i in range(n):
        if S[i] == '<':
            dp[i + 1] = dp[i]
        elif S[i] == '>':
            dp[i + 1] = dp[0]
        elif S[i] == 'o':
            dp[i + 1] = sum(dp) % MOD
        else:
            dp[i + 1] = sum(dp) % MOD
            dp[0] = (dp[0] + dp[i + 1]) % MOD
    return sum(dp) % MOD

T = int(input())
for t in range(T):
    S = input().strip()
    ans = solve(S)
    print(f'Case #{t+1}: {ans}')