#include <bits/stdc++.h>
 
using namespace std;

const int MOD = 100003;

inline int mod(long long n){
    if(n >= 0) return n % MOD;
    return ((-n/MOD+1)*MOD + n) % MOD;
}
 
int arr[10000][10000];
int dp[5005];
int main()
{
    char S[200001];
    scanf("%s", S);
    int L = strlen(S);
    for(int mid=1;mid<=L;mid++)
    {
        int H = 0, power = 1;

        for(int i=0; i<=L-mid; i++){
            if(i == 0){
                for(int j=0; j<mid; j++){
                    H = mod(H + 1LL*S[mid-1-j]*power);
                    if(j < mid-1) power = mod(power*2);
                }
            }
            else H = mod(2*(H - 1LL*S[i-1]*power) + S[i+mid-1]);
            arr[i][i+mid-1] = H;
        }
    }

    dp[0] = 1;

    for(int i=0;i<=(L/2);i++)
    {
      for(int j=1;j<=L;j++)
      {
        int L1 = i;
        int R1 = i + j - 1;
        int R2 = L-1-i;
        int L2 = R2-j+1;
        if(L2<=R1) break;
        if(arr[L1][R1]==arr[L2][R2])
        {
          bool issame = true;
          for(int k=0;k<j;k++)
          {
            if(S[L1+k]!=S[L2+k])
            {
              issame = false;
              break;
            }
          }
          if(issame)
          {
            dp[R1+1] += dp[i];
            dp[R1+1]%=1000000007;
          }
        }
      }
    }

    long long int res = 0;

    for(int i=0;i<=(L/2);i++)
    {
      res += dp[i];
      res%=(1000000007);
    }

    cout << res << '\n';

    return 0;
}