#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, N) for (int i = j; i < N; i++)

const ll mod = 1'000'000'007;
string S;
ll N, dp[1009];

ll dfs(ll pos) {
    if (pos * 2 >= N) return dp[pos] = 1;
    if (dp[pos] != -1) return dp[pos];

    ll res = 0;
    rep(i, pos + 1, N / 2 + 1) {
        if (S.substr(pos, i - pos) == S.substr(N-i, i - pos)) {
            res += dfs(pos + i);
        }
    }
    return dp[pos] = (res + 1LL) % mod;
}

int main() {
    cin >> S;

    N = S.size();
    rep(i, 0, N / 2 + 1) dp[i] = -1;

    cout << dfs(0) << endl;

    return 0;
}