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>.
Str = input().lstrip(')')
Str = Str.rstrip('(')
Count = 0
Op = 0
L = 0
Max = 0
for i in Str:
    if i == '(':
        Op += 1
    elif i == ')':
        Op -= 1
    L += 1
    if Op == 0:
        Count += 1
        if L > Max:
            Max = L
        L = 0
    elif Op < 0:
        Op = 0
        L = 0
if Count == 0:
    print(0, 1)
else:
    print(Max, Count)