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>.
n=input()
l1=[]
l2=[]
for i in range(len(n)):
    if n[i]=="(":
        l1.append(i)
    if (l1!=[]) and (n[i]==")"):
        lng = i-l1[-1]+1
        l1.pop()
        l2.append(lng)

if l2==[]:
    print(0,1)
else:    
    m=max(l2)
    mn=l2.count(m)
    print(m,mn)