Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word.

Hongcow has decided to try to make new words from this one. He starts by taking the word he just learned how to spell, and moves the last character of the word to the beginning of the word. He calls this a cyclic shift. He can apply cyclic shift many times. For example, consecutively applying cyclic shift operation to the word "abracadabra" Hongcow will get words "aabracadabr", "raabracadab" and so on.

Hongcow is now wondering how many distinct words he can generate by doing the cyclic shift arbitrarily many times. The initial string is also counted.
The first line of input will be a single string *s* (1 ≤ |*s*| ≤ 50), the word Hongcow initially learns how to spell. The string *s* consists only of lowercase English letters ('a'–'z').
For the first sample, the strings Hongcow can generate are "abcd", "dabc", "cdab", and "bcda".

For the second sample, no matter how many times Hongcow does the cyclic shift, Hongcow can only generate "bbb".

For the third sample, the two strings Hongcow can generate are "yzyz" and "zyzy".
abcd
4
bbb
1
yzyz
2
abcdefghijklmnopqrstuvwxyabcdefghijklmnopqrstuvwxy
25
zclkjadoprqronzclkjadoprqronzclkjadoprqron
14
zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz
1
xyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxyxy
2
y
1
ervbfotfedpozygoumbmxeaqegouaqqzqerlykhmvxvvlcaos
49
zyzzzyyzyyyzyyzyzyzyzyzzzyyyzzyzyyzzzzzyyyzzzzyzyy
50
zzfyftdezzfyftdezzfyftdezzfyftdezzfyftdezzfyftde
8
yehcqdlllqpuxdsaicyjjxiylahgxbygmsopjbxhtimzkashs
49
yyyyzzzyzzzyzyzyzyyyyyzzyzyzyyyyyzyzyyyzyzzyyzzzz
49
zkqcrhzlzsnwzkqcrhzlzsnwzkqcrhzlzsnwzkqcrhzlzsnw
12
xxyxxyxxyxxyxxyxxyxxyxxyxxyxxyxxyxxyxxyxxyxxyxxy
3
aaaaaaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaaaaab
25
aabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaabaaaba
4
pqqpqqpqqpqqpqqpqqpqqpqqpqqpqqpqqppqppqppqppqppq
48
zxkljaqzxkljaqzxkljaqzxkljaqzxrljaqzxkljaqzxkljaq
49
abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwx
50
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaz
50
abcddcba
8
aabaabaabaacaabaabaabaacaabaabaabaacaabaabaabaac
12
aabaabcaabaabcdaabaabcaabaabcd
15
ababaababaaababaababaaaababaababaaababaababaaaa
47
ababaababaaababaababaaaababaababaaababaababaaa
23
aaababaab
9
aba
3
s = input()
table = [s]
for x in range(len(s)):
    s1 = list(s)
    temp = s1[0]
    s1.remove(s1[0])
    s1.append(s1[0])
    s = "".join(s1)
    if s not in table:
        table.append(s)
    else:
        break
print(len(table))