#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <random>
#include <chrono>
using namespace std;

class RollingHash{
  const string& str_;
  vector<long long> c_;
  vector<long long> mod_;
  vector<vector<long long>> hash_;
  vector<vector<long long>> pow_mod_;
 public:
  RollingHash(const string& s, const vector<long long>& c, const vector<long long>& mod)
   : str_(s),
     c_(c.begin(), c.end()), 
     mod_(mod.begin(), mod.end()), 
     hash_(mod.size(), vector<long long>(s.size()+1, 0)), 
     pow_mod_(mod.size(), vector<long long>(s.size()+1, 1))
  {
    assert(c_.size() > 0); assert(c_.size() == mod_.size());
    
    for(int k=0; k<mod_.size(); ++k) for(int i=1; i<=str_.size(); ++i){
      pow_mod_[k][i] = pow_mod_[k][i-1] * c_[k] % mod_[k];
    }
    
    for(int k=0; k<mod_.size(); ++k) for(int i=1; i<=str_.size(); ++i){
      hash_[k][i] = (hash_[k][i-1] * c_[k] + str_[i-1]) % mod_[k];
    }
  }

  // [l,r)
  vector<long long> get_hash(int l, int r){
    vector<long long> ret(mod_.size());
    int len = r-l;
    for(int k=0; k<mod_.size(); ++k){
      ret[k] = (hash_[k][r] - hash_[k][l] * pow_mod_[k][len] % mod_[k] + mod_[k]) % mod_[k];
    }
    return ret;
  }
};

const long long mod = 1000000007;

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

  RollingHash rh(s, {100009ll}, {1ll<<32});

  vector<long long> dp(n+1, 0);
  dp[0] = 1;

  long long ans = 1;
  for(int i=1; i<=n/2; i++){
    for(int j=0; j<i; j++){
      if(dp[j]==0) continue;
      auto x = rh.get_hash(j,i);
      auto y = rh.get_hash(n-i, n-j);
      if(x==y){
        dp[i] += dp[j];
        if(dp[i]>=mod) dp[i] -= mod;
      }
    }
    ans += dp[i];
    if(ans >= mod) ans -= mod;
  }

  printf("%lld", ans);
  return 0;
}