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>.
a=input()
s=[-1]
maxi=0
for i in range(len(a)):
    if a[s[-1]]=='(' and a[i]==')' and len(s)>1:
        s.pop()
        maxi=max(maxi,i-s[-1])
    else:
        s.append(i)

num=0
for j in range(0,len(s)-1,1):
    if s[j+1]-s[j]>1:
        num+=1
if s[-1]!=len(a)-1:
    num+=1

if num==0:
    num=1
            
print(maxi,num)            
