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
s=raw_input()
n=len(s)
aset=set()
for i in xrange(n):
    for j in xrange(n-i):
        aset.add(s[j:j+i+1])
print len(aset)