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()
sub=[]
n=len(s)
for i in range(0,n):
	for j in range(i,n):
		sub.append(s[i:j+1])
l=set(sub)

print len(l)