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>.
string = input()
regular = ''
longest = ''
actual = ''
count = 0
for c in string:
    if c=='(':
        count += 1
        actual += c
        regular += c
    else:
        count -= 1
        actual += c
        regular += c
        if count<0:
            count = 0
            regular = ''
            actual = ''
        elif count==0:
            if len(actual)>len(longest):
                longest = actual
                actual = ''
print(longest)
if len(longest)==0:
    print(0, 1)
else:
    print(len(regular), longest[1:-1].count(')'))
