Count Occurrences of 'chuanzhi' Substring

Given a string \(s\) consisting only of lowercase letters, your task is to determine how many times the substring \(\texttt{chuanzhi}\) appears in \(s\).

We say that a string \(t\) is a substring of \(s\) if and only if after removing some (possibly zero) consecutive characters from the beginning and some (possibly zero) consecutive characters from the end of \(s\), the remaining string is equal to \(t\). For example, ab is a substring of abc, but ac is not.

inputFormat

The input consists of a single line containing the string \(s\), which is composed only of lowercase letters.

outputFormat

Output a single integer representing the number of times the substring \(\texttt{chuanzhi}\) appears in \(s\).

sample

chuanzhichuanzhi

2