#include <stdio.h>

int main()
{
	char S[10010];
	scanf("%s", S+1);
	int l = 0;
	while (S[l+1]) l++;
	int n = l / 2;

	const int mod = 1000000007;
	int d[5005] ={ 1, };
	for (int u=2;u<=2*n;u++){
		int as = u / 2, ae = (u + 1) / 2;
		int bs = l + 1 - ae, be = l + 1 - as;
		while (1 <= as && ae <= n && S[as] == S[bs] && S[ae] == S[be]){
			d[ae] = (d[ae] + d[as-1]) % mod;
			as--; ae++;
			bs--; be++;
		}
	}

	int ans = 0;
	for (int i=0;i<=n;i++) ans = (ans + d[i]) % mod;
	printf("%d\n", ans);

	return 0;
}