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>.
if __name__ == "__main__":
    cadena = input()
    pila = []
    count = length = actual = 0
    maybe = False
    for i in cadena:
        if i == '(':
            pila.append(i)
        elif i == ')' and len(pila) > 0:
            actual += 2
            length = max(length,actual)
            pila.remove('(')
            if len(pila) == 0:
                count += 1
                actual = 0
                maybe = True
    if maybe:
        print(length,count)
    else:
        print(0,1)
				 			 	 	       							 	  	