#include #include #include template struct ModInt { using lint = long long; int val; // constructor ModInt(lint v = 0) : val(v % MOD) { if (val < 0) val += MOD; }; // unary operator ModInt operator+() const { return ModInt(val); } ModInt operator-() const { return ModInt(MOD - val); } ModInt inv() const { return this->pow(MOD - 2); } // arithmetic ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; } ModInt pow(lint n) const { auto x = ModInt(1); auto b = *this; while (n > 0) { if (n & 1) x *= b; n >>= 1; b *= b; } return x; } // compound assignment ModInt& operator+=(const ModInt& x) { if ((val += x.val) >= MOD) val -= MOD; return *this; } ModInt& operator-=(const ModInt& x) { if ((val -= x.val) < 0) val += MOD; return *this; } ModInt& operator*=(const ModInt& x) { val = lint(val) * x.val % MOD; return *this; } ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); } // compare bool operator==(const ModInt& b) const { return val == b.val; } bool operator!=(const ModInt& b) const { return val != b.val; } bool operator<(const ModInt& b) const { return val < b.val; } bool operator<=(const ModInt& b) const { return val <= b.val; } bool operator>(const ModInt& b) const { return val > b.val; } bool operator>=(const ModInt& b) const { return val >= b.val; } // I/O friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { lint v; is >> v; x = v; return is; } friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; } }; template std::vector zalgo(const Container& dat) { int n = dat.size(); std::vector ret(n); ret[0] = n; int i = 1, len = 0; while (i < n) { while (i + len < n && dat[len] == dat[i + len]) { ++len; } ret[i] = len; if (len == 0) { ++i; continue; } int nlen = 1; while (i + nlen < n && nlen + ret[nlen] < len) { ret[i + nlen] = ret[nlen]; ++nlen; } i += nlen; len -= nlen; } return ret; } constexpr int MOD = 1000000007; using mint = ModInt; void solve() { std::string s; std::cin >> s; int n = s.length(); std::vector dp(n, 0); dp[0] = 1; mint ans = 0; for (int i = 0, j = n; i <= j; ++i, --j) { ans += dp[i]; int m = j - i; auto zs = zalgo(s); for (int l = 1; i + l <= j - l; ++l) { if (zs[m - l] < l) continue; dp[i + l] += dp[i]; } s.erase(s.begin()); s.pop_back(); } std::cout << ans << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }