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