Problem Description

This problem is translated from PA 2018 Round 1 Język polski.

Given a string $s$, find the number of substrings that satisfy the following condition.

• In this substring, there exists at least one length $3$ substring consisting only of consonant letters or only of vowel letters.

Note that Polish vowels are different from English. In Polish, the vowels are $a,e,i,o,u,y$.

Any letter that is not a vowel is a consonant.

Input Format

One line containing a string $s$ consisting only of lowercase letters.

Output Format

Output one integer in one line, representing the number of substrings that satisfy the condition.

kostka

6

aaaa

3

Hint

Explanation for Sample 1

All substrings that satisfy the condition are as follows: $\texttt{stk},\texttt{ostk},\texttt{kostk},\texttt{stka},\texttt{ostka},\texttt{kostka}$.

Constraints

This problem uses bundled testdata.

Let the string length be $\mathrm{len}$, then $\mathrm{len} \le 200000$.

Translated by ChatGPT 5