Problem Description

Chuanzhi Vocational College gave Xiaozhi a string $s$ that contains only lowercase letters. He wants to know how many times the substring chuanzhi appears in it.

We say a string $t$ is a substring of $s$ if and only if, after deleting some consecutive characters at the beginning of $s$ (possibly 0 characters) and some consecutive characters at the end of $s$ (possibly 0 characters), the remaining string is exactly the same as $t$. For example, ab is a substring of abc, but ac is not a substring of abc.

Input Format

The input consists of one line containing a string $s$.

Output Format

Output one line with one integer, representing the answer.

welcometochuanzhicupchuanzhi

2

Hint

Constraints

For all testdata, it is guaranteed that $1 \leq |s| \leq 4 \times 10^5$. Here, $|s|$ denotes the length of $s$, and $s$ contains only lowercase letters.

Translated by ChatGPT 5