Problem A: String Problem A

Problem A: String Problem A

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 450  Solved: 266
[Submit][Status][Web Board]

Description

Given a string , you are required to calculate how many different substrings it has. Here we define two strings are different if and only if they have different length or have at least one position where they have different characters

Input

One line, indicating the string \(S\) \((1\leq |S|\leq 10^2)\)

Output

One integer, indicating the answer.

Sample Input

aab

Sample Output

5

HINT

[Submit][Status]