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

seq = input()

ds = {}

cur = 0

ds[0] = 0

high = 0
count = 0

for ind,b in enumerate(seq):
    if b == '(':
        cur += 1
    else:
        del ds[cur]
        cur -= 1
    if cur in ds:
        if ind-ds[cur] > high:
            high = ind-ds[cur]
            count = 1
        elif ind-ds[cur] == high:
            count += 1
    else:
        ds[cur] = ind

if high == 0:
    print(0,1)
else:
    print(high,count)
    
