407640: GYM102862 D Splitting Text

You are given a string $$$s$$$ of length $$$n$$$ that consists of lowercase English letters. We call a sequence of letters a word if it consists of at least one vowel and at least one consonant. What is the maximum number of words the given string can be partitioned into?

In this problem, we consider the vowels to be the letters a, i, o, u, e, y, and all the other letters are consonants.

The first line of input contains an integer $$$n$$$ ($$$1 \leq n \leq 10^5$$$), the length of the string. The next line contains the string $$$s$$$ consisting of lowercase English alphabet letters.

Output a single integer, the maximum possible number of words the string can be partitioned into. If it is not possible to partition the string in such a way, output $$$0$$$.

13
brownfoxjumps

3

4
iota

1

3
you

0