String Matching :
Difficulty Level : Easy
Submissions : 3850
Asked In :
Marks :100
: 10 | : 62
Given a string of length N contains only parentheses, Scan it to see if it is well nested or not.
The String is said to be well nested if we can apply any maths equation within the given parentheses correctly or not.
If the string is well-nested return it as it otherwise makes some operation says addition and modification by choosing any index and opening or closing bracket or modifying the current bracket.
We are not concerned with the number of operations we performed.
Input
The first line of the test case contains an integer N the length of the string ($$$1 \le N \le 10^5$$$).
The second line contains the string S of length N.
Output
For each test case print a well-formed string
Example
Input
5 (()))
Output
(())()
