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
Q=raw_input();	l=len(Q);	A=set()
for i in xrange(l):
	for j in xrange(i,l):
		temp=Q[i:j+1]
		A.add(temp)
print len(A)