시간 제한메모리 제한제출정답맞힌 사람정답 비율
3 초 (추가 시간 없음) 1024 MB67150242574.301%

문제

You are given a string $s$ consisting of lowercase English letters. A "kick" is defined as a substring of $s$ that starts with the letter 'k' followed by the letter 'i' followed by the letter 'c' followed by the letter 'k'.

Your task is to count the number of distinct "kicks" in the string $s$. Note that the kicks can overlap.

입력

The input contains exactly a string $s$ consisting of lowercase English letters. The length of the string $s$ is no more than $5 \times 10^6$.

출력

Print the number of "kicks" on a line.

예제 입력 1

kickickstartkicks

예제 출력 1

3

예제 입력 2

kickkickkickkick

예제 출력 2

4