Migrated from Lutece 2317 Nico~Nico~Ni~

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

As we all know, Nico Yazawa is the queen of kichiku in bilibili and no one can avoid being brainwashed by her NicoNicoNi~.If you don't, please click here.

Just now another video about Nico was uploaded to bilibili. As a counting bacteria, you want to count how many NicoNicoNi~ can be heard in the video.

More generally, you will be given a string $S$ only consisting of letters N, i, c and o, and you should calculate the number of substrings equal to NicoNicoNi of $S$.

Note that a substring of a string $S$ is a continuous segment of letters from $S$. For example, tec is a substring of Lutece but tce is not.

Input

A string $S$ only consisting of letters N, i, c and o, the length of $S$ will not exceed $10^5$.

Output

Please print NicoNicoNi * n, and $n$ is the number of substrings that equals to NicoNicoNi of $S$. (Please note the blank space!)

Samples

NicoNicoNicoNicoNico

NicoNicoNi * 3

Resources

电子科技大学第十一届 ACM 趣味程序设计竞赛