MOD = 10**9 + 7

def solve_case(s):
    n = len(s)
    dp = [[[0] * (n+1) for _ in range(n+1)] for _ in range(n+1)]
    for j in range(1, n+1):
        if s[j-1] in {'o', '<', '='}:
            dp[1][j][j] = 1
    for i in range(2, n+1):
        for j in range(1, n+1):
            for k in range(j, n+1):
                if s[i-1] == 'o':
                    dp[i][j][k] = (dp[i-1][j-1][k-1] + dp[i-1][j][k] + dp[i-1][j+1][k+1]) % MOD
                elif s[i-1] == '<':
                    dp[i][j][k] = dp[i-1][j][k]
                elif s[i-1] == '>':
                    dp[i][j][k] = dp[i-1][