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
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
s=raw_input()
l=len(s)
sub=[]
for i in range(l):
	for j in range(i,l):
		sub.append(s[i:j+1])
			#print s[i:j]
print len(set(sub))
#print set(sub)