def z_algorithm(s):
    n = len(s)
    Z = [0]*n
    Z[0] = n
    i = 1
    j = 0
    while i < n:
        while i+j < n and s[j] == s[i+j]:
            j += 1
        Z[i] = j
        if j == 0:
            i += 1
            continue
        k = 1
        while i+k < n and k+Z[k] < j:
            Z[i+k] = Z[k]
            k += 1
        i += k
        j -= k
    return Z

s = str(input())
n = len(s)
mod = 10**9+7
dp = [1]*(n//2+1)
for i in reversed(range(n)):
    if i >= n-i:
        continue
    t = s[i:n-i]
    Z = z_algorithm(t)
    for j in range(1, len(t)//2+1):
        if Z[len(t)-j] == j:
            dp[i] += dp[i+j]
            dp[j] %= mod
#print(dp)
print(dp[0]%mod)