#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define INF 120000000
#define MOD 1000000007

using namespace std;

typedef pair<int, int> P;
typedef long long int LL;

int main() {
    string s;
    cin >> s;
    int n = s.size();

    vector<string> t;
    string f = "", b = "";
    int l = 0, r = n - 1;
    while (l < r) {
        f += s[l]; b = s[r] + b;
        l++; r--;
        if (f == b) {
            t.pb(f);
            f = "";
            b = "";
        }
    }

    // for (int i = 0; i < t.size(); i++) {
    //     cout << t[i] << endl;
    // }

    LL ans = 1;
    LL cnt = 0;
    for (int i = t.size() - 1; i >= 0; i--) {
        int cnt = 0;
        int j = i - 1;
        string tmp = t[i];
        // cout << tmp << endl;
        while (j >= 0) {
            tmp += t[j];
            // cout << "tmp = " << tmp << endl;
            if (tmp.size() % 2 == 0) {
                string rev = tmp.substr(tmp.size() / 2);
                reverse(rev.begin(), rev.end());
                if (tmp.substr(0, tmp.size() / 2) == rev) {
                    cnt++;
                }
            } else {
                // cout << tmp.substr(0, tmp.size() / 2) << " " << tmp.substr(tmp.size() / 2 + 1) << endl;
                string rev = tmp.substr(tmp.size() / 2 + 1);
                reverse(rev.begin(), rev.end());
                if (tmp.substr(0, tmp.size() / 2) == rev) {
                    cnt++;
                }
            }
            j--;
        }
        // cout << ans << " " << cnt << endl;
        ans += ans * cnt;
        ans++;
        ans %= MOD;
    }

    cout << ans % MOD << endl;

    return 0;
}