def atoi(a):
    return ord(a) - ord("a") + 1


S = input()
N = len(S)
mod = 10 ** 9 + 7

pow2 = [1] * (N + 1)
for i in range(N):
    pow2[i + 1] = pow2[i] * 2 % mod

dp = [[0] * 27 for _ in range(N + 1)]
dp[0][0] = 1
for i, s in enumerate(S):
    for j in range(27):
        dp[i + 1][j] = dp[i][j]
    s = atoi(s)
    dp[i+1][s] += sum(dp[i]) % mod
    dp[i+1][s] %= mod


ans = pow2[N] - 1
for i, s in enumerate(S):
    s = atoi(s)
    for j in range(1, 27):
        if s == j:
            continue
        ans += dp[i+1][j] * pow2[N-i-1]
        ans %= mod

print(ans)