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>.
s=input()
L=[0]*(len(s)+1)
x=0  #(
y=0  #)
stack=[]
for i in range(len(s)):
    if s[i]==")":
        y+=1
        if stack!=[]:
            L[i-stack.pop()]+=1
    else:
        x+=1
        stack.append(i)




f=1
for i in range(len(s),1,-1):
    if L[i]!=0:
        print(i,L[i])
        f=0
        break
if f:
    print(0,1)
        
        
