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):

    stack=[]
    maxi=[0,1]
    count=0
    for i in s:
        if i==")":
            if stack:
                stack.pop()
                count+=1
            else:
                if count and maxi[0]==count:
                    maxi[1]+=1
                elif maxi[0]<count:
                    maxi=[count,1]
                count=0            
        else:
            stack.append(i)
    if count and maxi[0]==count:
        maxi[1]+=1
        maxi[0]+=count
    elif maxi[0]<count:
        maxi=[count,1]
    return str(maxi[0])+" "+str(maxi[1])

                                               


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