We love to code. Thereby we also like the four characters, 'c', 'o', 'd' and 'e'.

A substring of the given string, $S$ is called "Eunoia string" if the frequency of characters  'c', 'o', 'd' and 'e' in the substring is equal to each other.

Find the number of "Eunoia strings" in the given string, $S$ .

Input Format: -

First line contains $N$ – no of characters in string, $S$. Next line contains the string $S$.

Output Format: -

Output a single integer denoting the number of "Eunoia strings" in $S$.

Constraints:

1 <= $N$ <= 10⁵

All the characters of the string $S$ are lowercase alphabets.