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>.
s = input()
n = len(s)
stk = []
c = 0
c1 = 0
for i in range(n):
    
    if(s[i] == "("):
        stk.append(s[i])
        c = c + 1

    elif(s[i] == ")"):
        
        if(len(stk) != 0):
            c = c + 1
            stk.pop()
            if(len(stk) == 0):
                c1 = c1 + 1
if(c < 5):
    print("0 1")
else:
    print(c // c1, c1)
  	  	 						 	 	   					 	 			