#include <iostream>
#include <string>
#include <vector>

const long long int MOD=1e9+7;
const long long int BASE=31;

using namespace std;

// vector<long long int> memo(10101, 0);
// vector<long long int> memd(10101, 0);
vector<long long int> memo;
vector<long long int> memd;

struct RollingHush {
    vector<long long int> hash;
    vector<long long int> power;
    string str;
    
    RollingHush(string s) : hash(s.size()+1), power(s.size()+1) {
        str=s;
        hash[0]=0;
        power[0]=1;
        for(int si=0; si<s.size(); si++) {
            long long int s2lli=s[si];
            s2lli %= BASE;
            
            hash[si+1] = (hash[si]*BASE+s2lli)%MOD;
            power[si+1] = power[si]*BASE%MOD;
        }
    }
    
    long long int get(int left, int right) {
        return ((hash[right]-hash[left]*power[right-left])%MOD+MOD)%MOD;
    }

    int size() {
        return str.size();
    }
};

long long int count_kaibunkai(RollingHush rh, int left, int right) {
    long long int count=1;
    if(right-left<=1) {
        return count;
    }
    if(memd[left]) {
        return memo[left];
    }

    int l=left+1, r=right-1;
    while(l<=r) {
        if(rh.get(left, l)==rh.get(r, right)) {
            count += count_kaibunkai(rh, l, r)%MOD;
        }
        l++;
        r--;
    }
    memd[left]=1;
    return memo[left]=count%MOD;
}

int main() {
    string str;
    cin >> str;

    memo.assign(str.size()/2+1, 0);
    memd.assign(str.size()/2+1, 0);
    
    RollingHush rh_str(str);
    
    cout << count_kaibunkai(rh_str, 0, str.size()) << endl;

    return 0;
    
}