write a go solution for Description:
Lura was bored and decided to make a simple language using the five letters texttta, textttb, textttc, textttd, texttte. There are two types of letters:

- vowels — the letters texttta and texttte. They are represented by textsfV.
- consonants — the letters textttb, textttc, and textttd. They are represented by textsfC.

A word in the language is a sequence of syllables. Lura has written a word in the language, but she doesn't know how to split it into syllables. Help her break the word into syllables.

For example, given the word textttbacedbab, it would be split into syllables as textttba.ced.bab (the dot texttt. represents a syllable boundary).

Input Format:
The input consists of multiple test cases. The first line contains an integer t (1<=t<=100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n (1<=n<=2*10^5) — the length of the word.

The second line of each test case contains a string consisting of n lowercase Latin characters  — the word.

All words given are valid words in the language; that is, they only use the letters texttta, textttb, textttc, textttd, texttte, and each word is made up of several syllables.

The sum of n over all test cases does not exceed 2*10^5.

Output Format:
For test case, output a string denoting the word split into syllables by inserting a dot texttt. between every pair of adjacent syllables.

If there are multiple possible splittings, output any of them. The input is given in such a way that at least one possible splitting exists.

Note:
None. Output only the code with no comments, explanation, or additional text.