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>.
from sys import stdin
input = stdin.readline
put = lambda : list(map(int, input().split()))

t = list(input().strip())
m, c, s, l, p = 0,0,0,0,0
for i in t:
    if i=='(':
        s+=1
    else:
        if s>0:
            s-=1
            l+=2
            m = max(m,l)
            if p==0:
                p=1
                c+=1
        else:
            s=0
            p=0
            l=0
if m==0:
    print(0,1)
else:
    print(m, c)



