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 = str(input())
def solve(s,k):
    stack = []
    n = len(s)
    ans = [0]
    prev = 0
    for i in range(n):
        if s[i]==k:
            if stack:
                val = i+1-stack.pop()
                # ans.append(val+prev)
                # prev +=val
                if not stack:
                    prev += val
                    ans.append(prev)
                else:
                    ans.append(val)
            else:
                prev = 0
        else:
            stack.append(i)
        # print(stack,ans[-2:],prev,"INDEX",i)
    Max = max(ans)
    return [Max,ans.count(Max)]
a,b = solve(s,")")
c,d = solve(s[::-1],"(")
if  a>c:
    print(a,b)
else:
    print(c,d)