from functools import lru_cache
@lru_cache(maxsize=100000000)

def is_kaibun (S):
	l = len(S)
	left_index = 1
	right_index = l-1
	count = 1

	while left_index-1 < right_index:
		if S[0:left_index] == S[right_index:]:
			count += is_kaibun(S[left_index:right_index])
		left_index += 1
		right_index -= 1
	return count
			

if __name__ == "__main__":
	S = input()
	l = len(S)

	ans = is_kaibun(S) % 1000000007

	print(ans)