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()
depth = 0
sc = 0
sc_list = []
for i in s:
    print(i,depth,sc)
    if i == '(':
        depth +=1
    elif depth >0:
        sc+=2
        depth -=1
    if sc!=0 and depth==0:
        sc_list.append(sc)
        sc = 0

if len(sc_list):
    print(max(sc_list),len(sc_list))
else:
    print("0 1")