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>.
def main():
    string=input()
    arr=list(string)
    maximum=0
    freq=1
    for y in range(len(arr)):
        if arr[y]=="(":
            break
    store=[y]
    for x in range(y,len(arr)):
        if arr[x]=="(":
            store.append(x+1)
        else:
            if len(store)>0:
                del store[-1]
                if len(store)>0:
                    test=x-store[-1]+1
                    if test>maximum:
                        maximum=test
                        freq=1
                    elif test==maximum:
                        freq+=1
    print(maximum,freq)
            
            


main()
