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>.
# ﷽
from collections import defaultdict, deque
import sys
input = lambda: sys.stdin.readline().strip()

def inlst():return [int(i) for i in input().split()]

def solve():
    s=input()
    d=deque()
    dic=defaultdict(int)
    tmp=0
    for i, j in enumerate(list(s)):
          if j=='(':d.append(i)
          elif j==')':
                if d:d.pop();tmp+=1
                else:
                      dic[tmp]+=1
                      tmp=0
    dic[tmp]+=1
    if max(dic)==0:print (0,1);return
    print(max(dic)*2,dic[max(dic)])
                

    

if __name__ == "__main__":
    # for i in range(int(input())):
        solve()
