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>.
from collections import deque
s = input()
arr = deque([0])
m = 0
m_count = 1
count = 0
k = 1
for skob in s:
    if skob == '(':
        arr.append(k)
    else:
        if len(arr)>=1:
            arr.pop()
        if len(arr) >= 1:
            dl = k - arr[-1]
            if dl> m:
                m_count = 1
                m = dl
            elif dl == m:
                m_count += 1
            
    k += 1
    

print(m,m_count)
