B. Breaking Rosarigasino
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Camila is visiting Rosario for the first time. As she walked through its streets, she heard words she didn't understand, so she decided to write them down in her travel log.

Upon arriving at her hotel room, she decided to decipher this mysterious code. After spending hours analyzing the words, she thinks she has figured it out:

People from Rosario take a word, duplicate one of its vowels (A, E, I, O, U), and then insert the word GAS between the two vowels. For example:

ROSARINO $$$\rightarrow$$$ ROSARIINO $$$\rightarrow$$$ ROSARIGASINO.

Now she wants to take her list and translate it by reversing this transformation. However, she noticed that she had words that did not seem to follow this rule, such as PRALINE and ENTRECOT. She also found words that could have more than one possible translation, such as AGASAJOGASO, which could come from AGASAJO or from AJOGASO.

Camila wants us to write a program that helps her with this tedious task.

Input

A single line containing a string of $$$N$$$ characters $$$(1 \leq N \leq 100)$$$, consisting of uppercase English letters from A to Z. It is also guaranteed to contain at least one vowel.

Output

If there is exactly one possible translation, the translated word.

If there is more than one possible translation, the character '+'.

If there is no possible translation, the character '-'.

Examples
Input
ROSARIGASINO
Output
ROSARINO
Input
PRALINE
Output
-
Input
AGASAJOGASO
Output
+
Input
TAGASAP
Output
TAP
Input
ENTREGASEGASEMOS
Output
ENTREGASEMOS