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()
c=0
m=0
a=[]
j=[]
for i in range(len(s)):
    if(s[i] == '('):
        j.append(i)
        a.append('(')
    elif(s[i] == ')' and len(a) > 0):
        a.pop()
    if(len(a) == 0 and len(j) > 0):
        m=max(m,i-j[0]+1)
        j=[]
        c+=1
if(not(m==0 and c==0)):
    print(m,c)
else:
    print(0,1)