You are given a string S. Find the number of different substrings in S.

Input
One line containing a string S consisting of lowercase Latin letters.

Output
Output one integer - answer to the question.

Constraints
1 ≤ length of S ≤ 1200

SAMPLE INPUT
abc

SAMPLE OUTPUT
6
substrings = set()
word = raw_input()
n = len(word)+1
for i in range(n):
    for j in range(i+1,n):
        substrings.add(word[i:j])
print len(substrings)