Draper the inventory keeper watches over the marble forum of Argentium's stores of charms. A careful computation stands between order and chaos. Task: Print the minimum number of parentheses (either kind) that must be inserted to make the sequence balanced. Input format: One line with a string of parentheses. Output format: Print the minimum insertion count. Constraints: 1 <= |s| <= 36660; characters are '(' and ')'.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s| <= 36660; characters are '(' and ')'.
