MOD = 10**9 + 7

def count_gold_placements(S):
    n = len(S)
    dp = [[0] * (n+1) for _ in range(2)]
    dp[0][0] = 1
    for i in range(1, n+1):
        curr, prev = i % 2, (i-1) % 2
        for j in range(n+1):
            if S[i-1] == 'o':
                dp[curr][j] = (dp[prev][j-1] + dp[prev][j] + dp[prev][j+1]) % MOD
                if j == 0:
                    dp[curr][j] = 0
            elif S[i-1] == '<':
                dp[curr][j] = dp[prev][j]
            elif S[i-1] == '=':
                dp[curr][j] = (dp[prev][