#include<iostream>
#include<vector>
using namespace std;
//Longest Common Prefix(s,s.substr(i)) O(|s|)
#include<vector>
vector<int>Zalgo(const string&s)
{
	vector<int>ret(s.size());
	ret[0]=s.size();
	int i=1,j=0;
	while(i<s.size())
	{
		while(i+j<s.size()&&s[j]==s[i+j])j++;
		ret[i]=j;
		if(j==0)
		{
			i++;
			continue;
		}
		int k=1;
		while(i+k<s.size()&&k+ret[k]<j)ret[i+k]=ret[k],k++;
		i+=k;j-=k;
	}
	return ret;
}
long mod=1e9+7,dp[10101];
string s;
main()
{
	cin>>s;
	dp[0]=1;
	long ans=0;
	for(int i=0;i*2<=s.size();i++)
	{
		ans+=dp[i];
		string t=s.substr(i,s.size()-i*2);
		vector<int>az=Zalgo(t);
		for(int j=1;2*(i+j)<=s.size();j++)
		{
			if(az[s.size()-2*i-j]>=j)(dp[i+j]+=dp[i])%=mod;
		}
	}
	cout<<ans%mod<<endl;
}