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>.
def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def msi(): return map(str,input().split())
def li(): return list(mi())

s=si()
cnt=0
ans,res=[0],[]

for i in s:
    if i=='(':
        res.append(i)
        
    if i==')':
        if res:
            if res[-1]=='(':
                res.pop()
                cnt+=2
                
        else:
            ans.append(cnt)
            cnt=0
            
ans.append(cnt)
if max(ans)==0:
    print(0,1)
    
else:
    print(max(ans),ans.count(max(ans)))
        