Substring (Easy)#5290

Substring (Easy)

1 second
128 megabytes
Very easy

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

Input

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

Output

Print the number of different substrings in .

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading