#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>


using namespace std;


using ull = unsigned long long;
using ll = long long;
using ld = long double;


#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)


template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> using pq  = priority_queue<T>;


template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return true; } return false; }


constexpr int MOD = 1000000007;


string s;
int n;
int memo[10005];
vector<vector<int>> Z;


vector<int> ZAlgorithm(string S) {
  int N = S.size();
  vector<int> Z(N, 0);

  Z[0] = N;
  int i = 1, j = 0;
  while (i < N) {
    while (i + j < N && S[i+j] == S[j]) ++j;
    Z[i] = j;

    if (j == 0) {
      ++i;
      continue;
    }

    int k = 1;
    while (k < j && k + Z[k] < j) {
      Z[i+k] = Z[k];
      ++k;
    }

    i += k;
    j -= k;
  }

  return Z;
}


int dp(int l, int r) {
  if (r - l <= 1) return 1LL;
  if (memo[l] != -1) return memo[l];

  int& ret = memo[l];
  ret = 1;

  for (int l2 = l+1, r2 = r-1; l2 <= r2; ++l2, --r2) {
    if (Z[l][r2 - l] >= l2 - l) {
      ret += dp(l2, r2);
      ret %= MOD;
    }
  }

  return ret;
}


int main() {
  cin >> s;
  n = s.size();

  memset(memo, -1, sizeof(memo));

  rep(i, n) {
    Z.push_back(ZAlgorithm(s.substr(i, n-i)));
  }

  cout << dp(0, n) << endl;
  return 0;
}