Problem Description

There is a string $ S $ of length $ N $.

You can perform the following operation any number of times:

• Replace a (contiguous) substring of $ S $ that matches one of axa, ixi, uxu, exe, oxo with ....

You want to perform the operation as many times as possible.

Output $ S $ after performing the operations to maximize the number of operations.

Input Format

The input is given from the standard input in the following format:

$ N $ $ S $

Output Format

Output $ S $ after the operations. If there are multiple possible answers, output any one of them.

Sample Input and Output

Sample Input #1

9
ixixixixi

Sample Output #1

...x...xi

Sample Input #2

6
auxuxa

Sample Output #2

a...xa

Sample Input #3

15
gxgaxixuxexoxxx

Sample Output #3

gxgaxixuxexoxxx

Notes/Hints

Constraints

• $1 \leq N \leq 2 \times 10^5$
• $ S $ is a string of length $ N $ consisting of lowercase English letters.

Sample Explanation 1

Other answers like ...xix... are also correct.

Sample Explanation 2

No further operations can be performed on a...xa.

Sample Explanation 3

It is possible that no operations can be performed at all.

见题面 Input 部分

见题面 Output 部分