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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

string s;
int t[10000][10000];
LL dp[10000], MOD = 1e9 + 7;

int main() {
	cin >> s;
	int n = s.size();
	
	inc(d, n) {
		int a = n - 1 - d;
		int b = n - 1;
		int c = 0;
		while(0 <= a) {
			if(s[a] == s[b]) { c++; } else { c = 0; }
			t[a][b] = c;
			a--; b--;
		}
	}
	
	/*
	inc(i, n) {
	inc(j, n) {
		printf("%2d ", t[i][j]);
	} cout << endl;
	} cout << endl;
	*/
	
	dp[0] = 1;
	inc1(i, n / 2) {
		inc1(j, i) {
			if(t[i - j][n - i] >= j) { (dp[i] += dp[i - j]) %= MOD; }
		}
	}
	
	LL ans = 0;
	inc(i, n) { (ans += dp[i]) %= MOD; }
	
	// inc(i, n) { cout << i << ": " << dp[i] << endl; }
	
	cout << ans << endl;
	
	return 0;
}