Deep in the otter slides of Sleekwater, Lila studies rows of verses entries. One clean number will settle the guild's oldest argument. 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| <= 48714; characters are '(' and ')'.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s| <= 48714; characters are '(' and ')'.
