Question
The Silent Consonant Scroll
In the same quiet library, Arin discovers another mysterious scroll.
According to legend, a fragment of the scroll is considered silent if it contains no vowels at all.
The vowels are: KaTeX can only parse string typed expression, KaTeX can only parse string typed expression, KaTeX can only parse string typed expression, KaTeX can only parse string typed expression, and KaTeX can only parse string typed expression.
Arin carefully examines every possible substring of the scroll. A substring is a contiguous sequence of characters taken from the string.
Your task is to help Arin count how many substrings are completely silent — that is, they contain only consonants and no vowels.
Input
The first line contains a single integer KaTeX can only parse string typed expression — the length of the scroll.
The second line contains a string KaTeX can only parse string typed expression of length KaTeX can only parse string typed expression, consisting of lowercase English letters.
The second line contains a string KaTeX can only parse string typed expression of length KaTeX can only parse string typed expression, consisting of lowercase English letters.
Output
Print a single integer — the number of substrings that contain no vowels.
Example
Input
9
bcidfagha
Output
9
Explanation
The substrings that contain no vowels are: {"b", "bc", "c", "d", "df", "f", "g", "gh", "h"}.
Thus, there are 9 substrings that contain no vowels.
9
bcidfagha
Output
9
Explanation
The substrings that contain no vowels are: {"b", "bc", "c", "d", "df", "f", "g", "gh", "h"}.
Thus, there are 9 substrings that contain no vowels.