Long before digital messaging, telegraph operators saved transmission time by writing certain recurring letter groups in a compact shorthand. Every shorthand message is built by concatenating, one after another with no spaces or separators, any number of exactly three fixed tokens: the single character G, the two-character token (), and the four-character token (al). You are given a shorthand message guaranteed to be composed of nothing but these three token types, one after another. Expand it back into plain text by replacing every G with G, every () with o, and every (al) with al, joining the replacements in the same order the tokens appeared, and print the result.

Input format

A single line containing the shorthand message -- a string made only of the characters G, (, ), a, and l that parses uniquely as a concatenation of the tokens G, (), and (al).

Output format

Print the expanded plain-text message on a single line.

Constraints

• 1 <= length of the shorthand message <= 100
• The message consists of one or more of the tokens G, (), and (al) concatenated in some order, with no other characters present

(al)G()

alGo

()()(al)G(al)

ooalGal