Codeforces Round #459 (Div. 2) C. The Monster（括号，问号变换，思维题，枚举题）

C. The Monster

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 slsl + 1... sr is pretty, where si 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 "()()()".

题意： 给出字符串，有括号 （），问号 ？，三种字符，问号可以变换为括号，看看能有多少个正确完美的子字符串，正确完美子字符串样式可以重复计算，但同一位置的子串只能算一次；

思路：可以看做枚举每一个区间，看当前区间的字符串，能不能组成完美字符串；也可以看做是包含当前字符的完美子串有多少个；

先把枚举到的问号？字符，都变为右括号，定义 top，num，num表示当前问号 '?' 变为右括号 ')' 的个数；当遇到 '('，top ++；当遇到 ')'，top --，当遇到问号的话，先变为 右括号 ')'，top--，num++；

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

// 可以说是包含当前这个字符的有多少个正确的子串，
//也可以说是枚举每一个区间，看当前区间，能否组成正确的子串,统计的子串样式可以重复； 
char str[5050]; 
int main()
{
	int i,j;
	while( ~scanf( "%s",str ) )
	{
		int l = strlen(str);
		int sum = 0;
		for(i = 0; i < l; i ++)  // 枚举当前字符；也可以说是枚举每一个区间； 
		{
			int top = 0,num = 0;   
			for(j = i; j < l; j ++) // 看包含这个字符的有多少个子串 
			{
				if(str[j] == '(')  top ++;
				else if(str[j] == ')') top --;
				else if(str[j] == '?')  num ++,top --;
				if(top<0&&!num) break;
				if(top<0&&num) top += 2,num --;
				if(!top) sum ++;
			}
		} 
		printf("%d\n",sum);
	}
	return 0;
}