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<sup class="upper-index">6</sup>.
s = ')((())))(()())'
s = s.replace('()', '**')
a = '(**)'
while a in s:
    s = s.replace(a, '*'*len(a))
    a = a.replace("**", "****")
s = s.replace(')', ' ')
s = s.replace('(', ' ')
ans = s.split()
print(len(max(ans, key=len)), len(ans))

