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>.
ch = input()
l1= [-1]
l2=[]

for i in range(len(ch)):
    if ch[i] == ')':
        if len(l1) > 1:
            l1.pop()
            lg = i - l1[-1]
            l2.append(lg)
            
        elif len(l1) == 1:
            l1[0] = i
    else:
        l1.append(i)

m=max(l2)
mn=l2.count(m)
print(m,mn)
