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>.
# https://codeforces.com/contest/5/problem/C
#  incomplete
s = input()
index, ct = [-1], []
answer = 0
for i in range(len(s)):
    if s[i] == "(":
        index.append(i)
        ct.append(s[i])
    else:
        if len(ct) > 0 and ct[-1] == "(":
            ct.pop()
            index.pop()
            answer = max(answer, i-index[-1])
        else:
            index.append(i)
index.append(len(s))
count = 0
while(len(index) > 1):
    x = index.pop()
    if (x-index[-1]-1) > 0:
        count += 1
if count == 0:
    count = 1
print(f"{answer} {count}")
