package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

// min for n entry
func nmin(a ...int) int {
	ret := a[0]
	for _, e := range a {
		ret = min(ret, e)
	}
	return ret
}

// max for n entry
func nmax(a ...int) int {
	ret := a[0]
	for _, e := range a {
		ret = max(ret, e)
	}
	return ret
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

// 先頭からの文字列と各文字から一致する文字列の長さを調べる
// 戻り値は各文字からの一致文字数（０は文字列の長さと一致）
func zalgo(str string) []int {
	n := len(str)
	a := make([]int, n)
	from, last := -1, -1
	a[0] = n
	for i := 1; i < n; i++ {
		idx := a[i]
		if from != -1 {
			idx = min(a[i-from], last-i)
			idx = max(0, idx)
		}
		for idx+i < n && str[idx] == str[idx+i] {
			idx++
		}
		a[i] = idx
		if last < i+idx {
			last = i + idx
			from = i
		}
	}
	return a
}

const mod = int(1e9 + 7)

var memo [11000]int

func rec(s string) int {
	if memo[len(s)] != 0 {
		return memo[len(s)]
	}

	ret := 1
	for i := 1; i <= len(s)/2; i++ {
		// out(s[:i], s[len(s)-i:])
		if s[:i] == s[len(s)-i:] {
			ret += rec(s[i : len(s)-i])
			ret %= mod
		}
	}
	memo[len(s)] = ret
	return ret
}

func rec2(s string) int {
	if memo[len(s)] != 0 {
		return memo[len(s)]
	}

	ret := 1
	a := zalgo(s)
	n := (len(s) + 1) / 2
	for i := n; i < len(s); i++ {
		if a[i] == len(s)-i {
			// out(a, i, a[i], s, s[a[i]:i])
			ret += rec2(s[a[i]:i])
		}
	}

	memo[len(s)] = ret
	return ret
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	s := getS()

	ans := rec2(s)
	out(ans)
}