K. Kick
time limit per test
3 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

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.

Input

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$$$.

Output

Print the number of "kicks" on a line.

Examples
Input
kickickstartkicks
Output
3
Input
kickkickkickkick
Output
4