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
# sys.stdout=open('C:\Program Files (x86)\Sublime Text 3\cp_setup\output.txt','w')
# sys.stdin=open('C:\Program Files (x86)\Sublime Text 3\cp_setup\input.txt','r')


import heapq
import math
import collections
import bisect
mod=10**9+7
def solve(s):
    n=len(s)
    dp=[0]*n
    st=[]
    maxi=0
    count=0
    for i in range(n):
        if s[i]=="(":
            st.append(i)
            continue
        elif not st:
            continue
        else:
            j=st.pop()
            dp[i]=i-j+1+dp[j-1]
        if maxi<dp[i]:
            maxi=dp[i]
            count=1
        elif maxi==dp[i]:
            count+=1
    if maxi: return str(maxi)+" "+str(count)
    return str(0)+" "+"1"
    

                                               


# t=int(input())
# for _ in range(t):
# n=int(input()) 
s=input()
print(solve(s))