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().strip()
top = 0
max_regular = 0
temp_max_regular = 0
total_substrings = 0

for bracket in s:
    if bracket == '(':
        top += 1
    elif top > 0:
        top -= 1
        temp_max_regular += 2
    else:
        max_regular = max(max_regular, temp_max_regular)
        if temp_max_regular != 0:
            total_substrings += 1
        temp_max_regular = 0

if temp_max_regular > 0:
    total_substrings += 1
    max_regular = max(max_regular, temp_max_regular)

if max_regular == 0:
    total_substrings = 1

print(max_regular, total_substrings)
