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>.
t=1
for i in range(t):
    s=input()
    pop=0
    stack=[]
    count=0
    j=-1
    maxm=0
    flag=0
    for i in range(len(s)):
        #print(stack)
        if(s[i]=='('):
            stack.append('(')
            j+=1
           
        else:
            if(len(stack)!=0 and stack[j]=='('):
                stack.pop()
                pop+=2
                j-=1
                flag=1
            else:
                if(maxm==pop):
                    count+=1
                if(maxm<pop):
                    maxm=pop
                pop=0
    if(maxm==pop):
        count+=1
    if(maxm<pop):
        maxm=pop
    if(maxm==0):
        print("0 1")
    else:
        print(maxm,count)
   
    
