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>.
d = ')((())))(()())'
s = list(d)
op = []
for i, j in enumerate(s):
    if j == '(':
        op += [i]
    elif j == ')':
        if op:
            s[op[-1]] = '*'
            del op[-1]
            s[i] = '*'
s = ''.join(s).replace(')', ' ')
s = s.replace('(', ' ')
ans = s.split()
t = len(max(ans, key=len))
num = 0
for i in ans:
    if len(i) == t:
        num += 1
print(len(max(ans, key=len)), num)

