You are given an input 'n'. You have to print all the balanced parentheses combinations of 'n' pairs of parentheses. NOTE: You can return your answer in any order.
Input Format
3
Output Format
["((()))","(()())","(())()","()(())","()()()"]
Constraints
1<=N<=8
Notice
NA
Example
Input
5
Output
[((((())))), (((()()))), (((())())), (((()))()), (((())))(), ((()(()))), ((()()())), ((()())()), ((()()))(), ((())(())), ((())()()), ((())())(), ((()))(()), ((()))()(), (()((()))), (()(()())), (()(())()), (()(()))(), (()()(())), (()()()()), (()()())(), (()())(()), (()())()(), (())((())), (())(()()), (())(())(), (())()(()), (())()()(), ()(((()))), ()((()())), ()((())()), ()((()))(), ()(()(())), ()(()()()), ()(()())(), ()(())(()), ()(())()(), ()()((())), ()()(()()), ()()(())(), ()()()(()), ()()()()()]