Question
The Magical Vowel Scroll
In a quiet library, a linguist named Arin is studying an ancient scroll written as a long string of lowercase letters. According to legend, a magical fragment of the scroll is said to be complete only if it contains all five vowels — 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 — at least once.
Arin examines every possible substring of the scroll and wants to know how many of them are complete. A substring is any continuous sequence of characters taken from the scroll.
Your task is to help Arin count the number of such complete substrings.
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 all five vowels at least once.
Example
Input
8
aeiouxyz
Output
4
Explanation
As Arin reads the scroll, the earliest moment all five vowels appear is in "aeiou".
Every extension of this substring to the right ("aeioux", "aeiouxy", "aeiouxyz") also remains complete.
Thus, there are 4 complete substrings in total.
Input
7
xaeiouy
Output
4
Explanation
There are 4 complete substrings in total: {"aeiou", "aeiouy", "xaeiou", "xaeiouy"}.
8
aeiouxyz
Output
4
Explanation
As Arin reads the scroll, the earliest moment all five vowels appear is in "aeiou".
Every extension of this substring to the right ("aeioux", "aeiouxy", "aeiouxyz") also remains complete.
Thus, there are 4 complete substrings in total.
Input
7
xaeiouy
Output
4
Explanation
There are 4 complete substrings in total: {"aeiou", "aeiouy", "xaeiou", "xaeiouy"}.