# Z algorithm
# https://snuke.hatenablog.com/entry/2014/12/03/214243
# 「S と S[i:|S|-1] の最長共通接頭辞の長さ」を記録した配列 A を構築

def z_algo(S):
    if len(S)==0:
        return []
    LEN=len(S)
    i=1
    j=0
    A=[0]*LEN
    A[0]=LEN

    while i<LEN:
        while i+j<LEN and S[j]==S[i+j]:
            j+=1
        A[i]=j
        
        if j==0:
            i+=1
            continue
        
        k=1
        while i+k<LEN and k+A[k]<j:
            A[i+k]=A[k]
            k+=1
        i+=k
        j-=k

    return A

mod=10**9+7

S=input().strip()
DP=[0]*((len(S)+1)//2+1)
DP[0]=1
ANS=0

for i in range((len(S))//2+1):
    A=z_algo(S[i:len(S)-i])
    #print(A)
    LIST=[]

    for j in range(len(A)-1):
        if A[len(A)-1-j]==j+1:
            LIST.append(j+1)
            #print("!",j+1)

    for l in LIST:
        if i+l<len(DP):
            DP[i+l]=(DP[i+l]+DP[i])%mod

    ANS=(ANS+DP[i])%mod

print(ANS)