CF1915D.Unnatural Language Processing

Lura was bored and decided to make a simple language using the five letters $\texttt{a}$, $\texttt{b}$, $\texttt{c}$, $\texttt{d}$, $\texttt{e}$. There are two types of letters:

• vowels — the letters $\texttt{a}$ and $\texttt{e}$. They are represented by $\textsf{V}$.
• consonants — the letters $\texttt{b}$, $\texttt{c}$, and $\texttt{d}$. They are represented by $\textsf{C}$.

There are two types of syllables in the language: $\textsf{CV}$ (consonant followed by vowel) or $\textsf{CVC}$ (vowel with consonant before and after). For example, $\texttt{ba}$, $\texttt{ced}$, $\texttt{bab}$ are syllables, but $\texttt{aa}$, $\texttt{eda}$, $\texttt{baba}$ are not.

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 $\texttt{bacedbab}$, it would be split into syllables as $\texttt{ba.ced.bab}$ (the dot $\texttt{.}$ represents a syllable boundary).

卢拉感到无聊，决定用五个字母 $\texttt{a}$、$\texttt{b}$、$\texttt{c}$、$\texttt{d}$、$\texttt{e}$ 构造一种简单的语言。这些字母分为两类：

• 元音字母 —— 字母 $\texttt{a}$ 和 $\texttt{e}$，用 $\textsf{V}$ 表示；
• 辅音字母 —— 字母 $\texttt{b}$、$\texttt{c}$ 和 $\texttt{d}$，用 $\textsf{C}$ 表示。

该语言中有两种类型的音节：$\textsf{CV}$（辅音后接元音）或 $\textsf{CVC}$（元音前后均为辅音）。例如，$\texttt{ba}$、$\texttt{ced}$、$\texttt{bab}$ 是合法的音节，但 $\texttt{aa}$、$\texttt{eda}$、$\texttt{baba}$ 不是。

该语言中的一个“词”是由若干音节依次连接而成的序列。卢拉已写出一个符合该语言规则的词，但她不知道如何将其切分为音节。请帮她将这个词正确地分割为音节。

例如，对于词 $\texttt{bacedbab}$，应将其分割为音节 $\texttt{ba.ced.bab}$（其中圆点 $\texttt{.}$ 表示音节边界）。

The input consists of multiple test cases. The first line contains an integer $t$ ($1 \leq t \leq 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 \leq n \leq 2 \cdot 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 $\texttt{a}$, $\texttt{b}$, $\texttt{c}$, $\texttt{d}$, $\texttt{e}$, and each word is made up of several syllables.

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

输入包含多个测试用例。第一行包含一个整数 $t$（$1 \leq t \leq 100$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 2 \cdot 10^5$），表示单词的长度。

每个测试用例的第二行包含一个由 $n$ 个小写拉丁字母组成的字符串——该单词。

所有给定的单词均为该语言中的有效单词；即，它们仅使用字母 $\texttt{a}$、$\texttt{b}$、$\texttt{c}$、$\texttt{d}$、$\texttt{e}$，且每个单词均由若干音节构成。

所有测试用例的 $n$ 值之和不超过 $2 \cdot 10^5$。

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.

对于测试用例，输出一个字符串，表示将单词按音节划分，并在每两个相邻音节之间插入一个点号 $\texttt{.}$。

如果存在多种可能的划分方式，输出其中任意一种即可。输入数据保证至少存在一种合法的划分方式。