#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

short LCP[10001][10001];

int main()
{
  string S;
  cin >> S;

  for(int i = S.size() - 1; i >= 0; i--) {
    for(int j = S.size() - 1; j >= 0; j--) {
      LCP[i][j] = S[i] == S[j] ? LCP[i + 1][j + 1] + 1 : 0;
    }
  }


  int dp[10000] = {}; // dp[i]: [0, i) が分割済みのときの組み合わせ
  dp[0] = 1;
  for(int i = 0; i < S.size() / 2; i++) {
    int j = (int) S.size() - i - 1;
    // cout << "[0," << i << "]" << " [" << j << "," << S.size() - 1 << "]" << endl;
    int ret = 0;
    for(int k = i; k >= 0; k--) { // 前回の分割終了位置
      // [k, i]==[l,l+(i-k)] だったら遷移OK
      const int l = (int) S.size() - i - 1;
      if(LCP[k][l] >= i - k + 1) (ret += dp[k]) %= mod;
      // cout << "[" << k << "," << i << "]" << " [" << l << "," << l + (i - k) << "]" << endl;
    }
    dp[i + 1] = ret;
  }

  int all = 0;
  for(int i = 0; i < S.size(); i++) {
    (all += dp[i]) %= mod;
  }
  cout << all << endl;
}