Suffixes

Let the string be a sequence of lowercase letters of the English alphabet. For example, empty sequence "" is a string, the word "aabaf" or an infinite sequence of letters "a" are strings too.

The i-th suffix S_i of the string S is the string S from which the first i letters are cut: so, for the string S = “aabaf” the suffixes will be:

S₀ = “aabaf”

S₁ = “abaf”

S₂ = “baf”

S₃ = “af”

S₄ = “f”

S₅ = S₆ = S₇ = . . . = “”

The suffixes are defined for all i > 0.

The cyclic extension S^* of a finite string S is a string obtained by appending it to itself an infinite number of times. So,

S^* = S₀^* = “aabafaabafaa...”

S₁^* = “abafabafabaf...”

S₂^* = “bafbafbafbaf...”

S₃^* = “afafafafafaf...”

S₄^* = “ffffffffffff...”

S₅^* = S₆^* = S₇^*= . . . = “”

For a given string S, find out how many of its suffixes S_i have the same cyclic extension as the string S itself that is the number of different i such that S^*= S_i^*.

Input

Input contains a string S consisting of 1 to 10⁵ lowercase letters of the English alphabet.

Output

Output the number of suffixes of the string S having the same cyclic extension as itself.

Samples

Для отправки решения задачи необходимо зарегистрироваться и авторизоваться!