This is yet another problem dealing with regular bracket sequences.
We should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not.
You are given a string of «(» and «)» characters. You are to find its longest substring that is a regular bracket sequence. You are to find the number of such substrings as well.
给出一个括号序列，求出最长合法子串和它的数量。 合法的定义：这个序列中左右括号匹配

The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. 
Its length does not exceed 10⁶ .

Print the length of the longest substring that is a regular bracket sequence, and the number of such substrings.
If there are no such substrings, write the only line containing "0 1".

样例二：
输入：
))(
输出：
0 1

算法 动态规划