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>.
cadenas = input()
stack = []
cont = 0
cont2 = 0
for a in cadenas:
    if a == "(":
        stack.append(a)
    elif a == ")" and len(stack) != 0:
        dat = str(stack.pop())
        cont += 1
        if len(stack) == 0:
            cont2 += 1
if cont == 0:
    print("0 1")
else:
    print(str(cont) + " " + str(cont2))