#230. parenBit

parenBit

Background

Description

Given a string that contains a single pair of parenthesis, compute recursively a new string made of only of the parenthesis and their contents, so "xyz(abc)123" yields "(abc)".

Format

Input

Output

Samples

xyz(ab
"(abc)"
x(hell
"(hello)"
(x
"(xy)"

Limitation

1s, 1024KiB for each test case.