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>.
s=input()
n=len(s)
d={}
d[0]=-1
d[1]=0
v=1
st=[]
m=0
c=1
st.append(s[0])
for i in range(1,n):
    if (s[i]==')') and (st[v-1]=='('):
        st.pop()
        v-=1
        if m==(i-d[v]):
            c+=1        
        elif m<(i-d[v]):
            m=i-d[v]
            c=1
        d[v]=i
    else:
        v+=1
        d[v]=i
        st.append(s[i])
print(m,c)