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()
index=[-1]
count=1
ma=0
for i in range(len(string)):
    #print(index)
    if(string[i]=='('):
        index.append(i)
    elif(len(index)>1):
        index.pop()
        n=i-index[-1]
        if(ma<n):
            ma=n
            count=1
        elif(ma==n):
            count+=1
    else:
        index[0]=i
print(str(ma),'',str(count))
            