A. SUN YAT-SEN University
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

SUN YAT-SEN University is a world-class university. All college students at SYSU love their university, especially ITcarrot.

He wrote down a string only containing lowercase English letters.

A string $$$T$$$ is called good if and only if the string sysu is a subsequence of the string $$$T$$$.

He wants to find out the number of good substrings of the string he had written down.

Noted that:

  • a subsequence of a string $$$S$$$ can be obtained by deleting some(including $$$0$$$) characters from $$$S$$$ without changing the order of the remaining characters.
  • a substring of a string $$$S$$$ is some contiguous characters in $$$S$$$. Two substrings are different if and only if their positions are different.
Input

One line, a string $$$S$$$($$$4\le |S| \le 10^6$$$) only contains lowercase English letters, denoting the string that ITcarrot wrote down.

Output

A single integer, denoting the number of good substrings.

Examples
Input
sunyatsenuniversity
Output
10
Input
syysuu
Output
2