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>.
#!/usr/bin/env python
# coding: utf-8

# In[2]:


from collections import deque
s=input()
stack=deque()
l=len(s)

stack.append(-1)
count=res=0
for i in range(l):
    if s[i]=='(':
        stack.append(i)
        
    else:
        stack.pop()
        if stack:
            if i-stack[-1]>res:
                count=1
                
            elif i-stack[-1]==res:
                count+=1
                
            res=max(res,i-stack[-1])
            
        else:
            stack.append(i)
            
if res:
    print(res,count)
    
else:
    print(0,1)


# In[ ]:




