P9078 [PA 2018] Polish Language

**This problem is translated from [PA 2018](https://sio2.mimuw.edu.pl/c/pa-2018-1/dashboard/) Round 1 [Język polski](https://sio2.mimuw.edu.pl/c/pa-2018-1/p/pol/)**. 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.

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

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

#### 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