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

MOD = 10**9+7
s = input()
if len(s)%2==0:
    s = s[:len(s)//2]+"*"+s[len(s)//2:]
n = len(s)
v = (n-1)//2
dp = [1]*(v+1)
for i in range(v+1)[::-1]:
    z = Z_algorithm(s[i:n-i])
    for k in range(1,v-i+1):
        if z[n-2*i-k] == k:
            dp[i] += dp[i+k]
    dp[i] %= MOD
print(dp[0]%MOD)