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();

n = len(s);
a= set();

for i in range (0,n+1):
	for j in range (i+1,n+1):
		a.add(s[i:j]);
		
print len(a);