A shipping system compresses repetitive labels with a bracket encoding. The encoding rule is k[encoded], meaning the decoded encoded string is repeated exactly k times, where k is a positive integer. Encodings may be nested, and plain lowercase letters outside any brackets are copied through unchanged. For example 3[a]2[bc] decodes to aaabcbc, and 2[a2[b]] decodes to abbabb.

The input is guaranteed to be a well-formed encoding: brackets are balanced, every [ is immediately preceded by a positive integer, and only lowercase letters appear inside as literal characters.

Input format

A single line: the encoded string (it may be empty).

Output format

A single line: the fully decoded string (an empty line if the decoding is empty).

Constraints

• 0 <= length of the encoded string <= 200
• Each repeat count k satisfies 1 <= k <= 100.
• The decoded string has length at most 10000.

3[ab]

ababab

2[a2[bc]]

abcbcabcbc