该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

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 number of different non-empty substrings of $S$.

Examples

Example 1

yay

5

S has the following five different non-empty substrings:

• a
• y
• ay
• ya
• yay

Example 2

aababc

17

Example 3

abracadabra

54