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>.
try:
    x=input() 
    k=[]
    r=0
    d=0
    for i in x:
        if i=="(":
            k.append(i)
        elif i==')':
            if k!=[] and k[-1]=="(":
                r+=1
                k=k[:-1]
            else:
                d+=1
    if r:
        print(r,d) 
    else:
        print(0,1)
    
except:
    pass
            