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>.
inp = input()
stack = []
max = 0
temp = 0
count = 0
for letter in inp:
    if letter=='(':
        stack.append('(')
    elif len(stack)==0:
        temp = 0
    else:
        temp+=2
        stack = stack[:-1]
        if max<temp:
            max = temp
        elif max==temp:
            count+=1
print(max,count)
        