MOD = 10**9 + 7

def solve():
    s = input().strip()
    n = len(s)
    lcount = rcount = qcount = ocount = eqcount = 0
    for c in s:
        if c == '<':
            lcount += 1
        elif c == '>':
            rcount += 1
        elif c == 'o':
            ocount += 1
        elif c == '=':
            eqcount += 1
        else:
            qcount += 1
    if ocount > 0:
        ans = pow(2, ocount, MOD)
    else:
        ans = pow(2, qcount, MOD) - (pow(2, qcount - 1, MOD) if eqcount > 0 else 0)
        if lcount > 0 and rcount > 0:
            ans = (ans + pow(2, lcount + rcount - 1, MOD)) % MOD
    return ans

t = int(input())
for i in range(1, t + 1):
    ans = solve()
    print("Case #{}: {}".format(i, ans))