The Monster （思维题）

The Monster

As Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, through the Christmas lights (he can turn them on and off with his mind). He can't directly tell his mom where he is, because the monster that took him to the Upside Down will know and relocate him.

Thus, he came up with a puzzle to tell his mom his coordinates. His coordinates are the answer to the following problem.

A string consisting only of parentheses ('(' and ')') is called a bracket sequence. Some bracket sequence are called correct bracket sequences. More formally:

• Empty string is a correct bracket sequence.
• if s is a correct bracket sequence, then (s) is also a correct bracket sequence.
• if s and t are correct bracket sequences, then st (concatenation of s and t) is also a correct bracket sequence.

A string consisting of parentheses and question marks ('?') is called pretty if and only if there's a way to replace each question mark with either '(' or ')' such that the resulting string is a non-empty correct bracket sequence.

Will gave his mom a string s consisting of parentheses and question marks (using Morse code through the lights) and his coordinates are the number of pairs of integers (l, r) such that 1 ≤ l ≤ r ≤ |s| and the string s_ls_l + 1... s_r is pretty, where s_i is i-th character of s.

Joyce doesn't know anything about bracket sequences, so she asked for your help.

Input

The first and only line of input contains string s, consisting only of characters '(', ')' and '?' (2 ≤ |s| ≤ 5000).

Output

Print the answer to Will's puzzle in the first and only line of output.

Examples

Input

((?))

Output

4

Input

??()??

Output

7

Note

For the first sample testcase, the pretty substrings of s are:

1. "(?" which can be transformed to "()".
2. "?)" which can be transformed to "()".
3. "((?)" which can be transformed to "(())".
4. "(?))" which can be transformed to "(())".

For the second sample testcase, the pretty substrings of s are:

1. "??" which can be transformed to "()".
2. "()".
3. "??()" which can be transformed to "()()".
4. "?()?" which can be transformed to "(())".
5. "??" which can be transformed to "()".
6. "()??" which can be transformed to "()()".
7. "??()??" which can be transformed to "()()()".

题意: 一个串s仅含(    ) ?   , 其中?可以变成 ( 和 )  . 问该串最多能有多少个匹配的长度,使得满足   () , (())，（（……）） 的情况?

思路:根据数据,明显的O(n^2)

用l表示到当前位置有多少个可用的(  , 用cnt表示到当前位置出现过多少个 ?

1. s[i]=='(',l++;   

    s[i]==')' l--

    s[i]=='?' l--,cnt++

2.if(l==0)正好匹配

   if(l<0 && cnt>0) l+=2,cnt-- 继续匹配

3. if (l<0&& cnt==0) break;后面不可能匹配.

很巧妙的思维，具体解释见代码

code:

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 5000+3;
char str[maxn];
int ans;
int main(){
    scanf("%s",str);
    int len = strlen(str);
    for(int i = 0; i < len; i++){//选起点
        int l = 0,cnt = 0;//l记录左括号个数，cnt记录问号个数
        for(int j = i; j < len; j++){//相当于选择了终点，依次往后看
            if(str[j] == '(') l++;
            else if(str[j] == ')') l--;
            else cnt++,l--;//一开始我们假设问号为右括号进行匹配，这样肯定会连带消去一个左括号所以l--
            //下面判断能否得到一组匹配
            if(l == 0) ans++;
            else if(l < 0 && cnt > 0) cnt--,l += 2;//如果l<0且问号个数不为零说明右括号多了，
                                                   //这时候我们把问号变成左括号那么这个问号的所有情况都看过了
                                                   //减去这个问号的，并且原来和这个问号匹配的左括号也释放了，所以此时左括号多了两个所以l+=2
            else if(l > 0) continue;
            else if(l < 0 && !cnt) break;
        }
    }
    printf("%d\n",ans);
    return 0;
}