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
string = raw_input()
length = len(string)
l = []
for i in xrange(length):
	for j in xrange(i,length):
		l.append(string[i:j + 1])
print len(set(l))