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>.
import re


x = input()

while re.match('.*\([A\(\)]*\).*', x):
    x = re.sub('\((A*)\)', 'A\\1', x)

print(x)

groups = re.split('\(|\)', x)
max_len = max([len(group) for group in groups])
longest = [g for g in groups if len(g) == max_len]
n_groups = len(longest)
if n_groups:
    print(max_len * 2, n_groups)
else:
    print('0 1')
