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
a=raw_input()
l=[]
c=1
while(c<=len(a)):
	for i in range(0,len(a)):
		l.append(a[i:i+c])
	c+=1
l1=set(l)
print(len(l1))