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>.
L = input()
n = 0 
large = 0
large_max = 0
lista = []
for l in L:
    if (l == '('):
        lista.append(l)
        large += 1
        if(len(lista) == 1):
            n += 1
    elif (l == ')'):
        if (len(lista) > 0):
            lista.remove('(')
            large += 1
            if (len(lista) == 0):
                if (large_max < large):
                    large_max = large
                large = 0
            
print (str(large_max) + " " + str(n))
