Given a string s. Count the number of its different substrings. Do not count the empty substring.

Input

One string s consisting of lowercase Latin letters. The string length is no more than 100 characters.

Output

Print the number of different substrings in s.