DifDif
Problem
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
Time Limit: 2
Memory Limit: 256
Source Limit:
