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()

stack = [-1]
max_count = 1
max_size = 0

for i, w in enumerate(s):
    if w == '(':
        stack.append(i)
    elif len(stack) > 1:
        stack.pop()
        t = i - stack[-1]
        if max_size < t:
            max_size = t
            max_count = 1
        elif max_size == t:
            max_count += 1
    else:
        stack[0] = 1


print(max_size, max_count)
