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
def ans(inp):
    s = tuple(inp)
    SubstringArray=[]
    for length in range(1, len(s)+1):
        for index in range(len(s)+1-length):
            SubstringArray.append(inp[index:index+length])
    return SubstringArray
x=raw_input()
danger=set(ans(x))
print len(danger)