#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MOD 1000000007LL
using namespace std;
typedef long long ll;

string S;

int main(void) {
  cin >> S;
  ll len = S.length();

  const ll base = 256;
  vector<ll> h(len + 1, 0), p(len + 1);
  p[0] = 1;
  REP(i, 0, len) {
    h[i + 1] = (h[i] * base + S[i]) % MOD;
    p[i + 1] = (p[i] * base) % MOD;
  }

  vector< vector<ll> > hash(len, vector<ll>(len));
  REP(i, 0, len) REP(j, i, len) hash[i][j] = (h[j + 1] - (h[i] * p[j - i + 1]) % MOD + MOD) % MOD;

  // REP(i, 0, len) REP(j, i, len) cout << S.substr(i, j - i + 1) << " " << hash[i][j] << endl;

  vector<ll> dp(len / 2 + 1, 0);
  dp[0] = 1;
  REP(i, 0, len / 2) {
    REP(j, 0, i + 1) {
      if(hash[j][i] == hash[len - i - 1][len - j - 1]) {
        dp[i + 1] += dp[j];
        dp[i + 1] %= MOD;
      }
    }
  }

  // REP(i, 0, dp.size()) cout << i << ": " << dp[i] << endl;

  ll ans = 0;
  REP(i, 0, dp.size()) {
    ans += dp[i];
    ans %= MOD;
  }
  cout << ans << endl;
}