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()
j=0
p=set()
for i in range(0,len(s)+1):
 	for j in range(1,len(s)+1):
 		p.add(s[i:j])
print len(p)-1
##print p