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>.
import sys;
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()


##code starts here
s = get_string();
l = 0;
r = 0;
ln = 0;
arr = [];
for i in range(len(s)):
    if(s[i]=="("):
        l+=1;
        ln+=1;
    else:
        if(l>0):
            l-=1;
            ln+=1;
        if(l==0):
            #print(l,ln)
            arr.append(ln);
            ln = 0;
    #print(l,ln);
arr.sort(reverse=True);
if(len(arr)==0 or arr[0]==0):
    print("0 1");
else:
    mx = arr[0];
    cnt = 0;
    for i in range(len(arr)):
        if(arr[i]==mx):
            cnt+=1;
    print(str(mx)+" "+str(cnt));
