using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static long NN => long.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var s = ReadLine();
        var mod = 1_000_000_007;
        var len = (s.Length + 1) / 2;
        var dp = new long[len];
        dp[len - 1] = 1;
        if (s.Length % 2 == 0 && s[len - 1] == s[len]) dp[len - 1] = 2;
        var h1 = new StringHash(StringHashInitializer.H1, s);
        var h2 = new StringHash(StringHashInitializer.H2, s);
        for (var i = len - 2; i >= 0; --i)
        {
            dp[i] = 1;
            if (s[i] == s[s.Length - 1 - i]) dp[i] = (dp[i] + dp[i + 1]) % mod;
            for (var j = i + 2; j < len; ++j)
            {
                if (h1.GetHash(i, j - 1) == h1.GetHash(s.Length - 1 - j + 1, s.Length - 1 - i) &&
                    h2.GetHash(i, j - 1) == h2.GetHash(s.Length - 1 - j + 1, s.Length - 1 - i))
                {
                    dp[i] = (dp[i] + dp[j]) % mod;
                }
            }
        }
        WriteLine(dp[0]);
    }
    public class StringHashInitializer
    {
        public static StringHashInitializer H1 = new StringHashInitializer(29, 998_244_391, 722_866_628);
        public static StringHashInitializer H2 = new StringHashInitializer(31, 998_244_397, 193_208_593);
        public int Mul;
        public int Mod;
        public int Rev;
        public StringHashInitializer(int mul, int mod, int rev)
        {
            Mul = mul; Mod = mod; Rev = rev;
        }
    }
    /// 部分文字列に対するハッシュコードを計算する
    class StringHash
    {
        int mul;
        int mod;
        long[] pow;
        long[] rev;
        // ここをFenwicktree等に変更することで、文字列の変更ができる
        long[] cum;
        // FenwickTree cum;
        public StringHash(StringHashInitializer ini, string s)
        {
            mul = ini.Mul;
            mod = ini.Mod;
            pow = new long[s.Length + 1];
            rev = new long[s.Length + 1];
            pow[0] = 1;
            rev[0] = 1;
            cum = new long[s.Length + 1];
            // cum = new FenwickTree(s.Length + 1);
            for (var i = 1; i <= s.Length; ++i)
            {
                pow[i] = pow[i - 1] * mul % mod;
                rev[i] = rev[i - 1] * ini.Rev % mod;
                cum[i] = (cum[i - 1] + (s[i - 1] - 'a' + 1) * pow[i]) % mod;
                // cum.Add(i, (s[i - 1] - 'a' + 1) * pow[i] % mod);
            }
        }
        /// <summary>部分文字列s[l..r]のハッシュ1を求める l,rは0-based</summary>
        public int GetHash(int l, int r)
        {
            if (l > r) return 0;
            return (int)((cum[r + 1] + mod - cum[l]) % mod * rev[l] % mod);
        }
    }
}