Count Special Words

You are given an integer T representing the number of test cases. For each test case, you are given an integer N followed by N words. A word is considered special if it contains at least three distinct vowels. The vowels are given by \(\{a,e,i,o,u\}\). Your task is to count the number of special words in each test case.

Example:

Input:
1
3
apple
banana
orange
Output:
1

</p>

inputFormat

The input is read from stdin and has the following format:

• The first line contains a single integer T denoting the number of test cases.
• For each test case, the first line contains an integer N denoting the number of words.
• The following N lines each contain a single word composed of lowercase letters.

outputFormat

For each test case, output a single line containing the number of special words. A word is considered special if it contains at least three distinct vowels. The output should be written to stdout.

## sample

1
2
sky
flow

0