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>.
#****************************************

#** Solution by BAZOOKA **

#** Sponsored by RED BULL**

#** Team Galaxy **

#** I love ❤Kateryna Gret❤ **

#****************************************/
n=input()
s,a,b,c=[],0,-1,1
for i in range(len(n)):
    if n[i]=='(':s.append(i)
    elif s:
        s.pop()
        t=i-s[-1] if s else i-b
        if t>a:a,c=t,1
        elif t==a:c+=1
    else:b=i

print(a,c)
#****************************************

#** Solution by BAZOOKA **

#** Sponsored by RED BULL**

#** Team Galaxy **

#** I love ❤Kateryna Gret❤ **

#****************************************/    