Score: $200$ points

问题陈述

给定一个由小写英文字母组成的字符串 $S$。$S$ 有多少个不同的非空子串？

子串是连续的子序列。例如，xxx 是 yxxxy 的子串，但不是 xxyxx 的子串。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

You are given a string $S$ consisting of lowercase English letters. How many different non-empty substrings does $S$ have?

A substring is a contiguous subsequence. For example, xxx is a substring of yxxxy but not of xxyxx.

Constraints

• $S$ is a string of length between $1$ and $100$, inclusive, consisting of lowercase English letters.

Input

The input is given from Standard Input in the following format:

$S$

Output

Print the answer.

Sample Input 1

yay

Sample Output 1

5

$S$ has the following five different non-empty substrings:

• a
• y
• ay
• ya
• yay

Sample Input 2

aababc

Sample Output 2

17

Sample Input 3

abracadabra

Sample Output 3

54