SOLVE
LATER
Alice and Bob are playing a game in which Bob gives a string $$S$$ of length $$N$$ consisting of lowercase English alphabets to Alice and ask her to calculate the number of sub-strings of this string which contains exactly $$3$$ vowels.
There will be $$T$$ test cases in the input and output the answer for each test case in a new line.
Sample Input:
The first line contains a single integer $$T$$. Each test case will consist of two lines, first line containing length of string and second line will contain the string.
Sample Output: :
Print the answer for each test case in a new line.
Constraints:
$$ 1 \le T \le 20 $$
$$ 1 \le N \le 10^5 $$
Only one substring is possible which is given by aebco.