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>.
from collections import deque

s = input()
stack = deque()
ls = [0]*1000000
ans = -1

for i in range(len(s)):
    if s[i] == ')':
        if stack:
            r = stack.pop()
            ls[i] = ls[r-1] + (i-r+1)
    else:
        stack.append(i)
    # print(ls, stack)

f_ans = max(ls)
count = ls.count(f_ans)

if f_ans <= 0:
    print(0, 1)
else:
    print(f_ans, count)
