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>.
'''input
))(
'''
from collections import defaultdict as dd
w=input().strip()
s=[]
d=dd(int)
c=0
for i in range(len(w)):
	if w[i]=="(":
		s.append("(")
	else:
		if len(s)>0:
			top=s[-1]
			if top=="(":
				c+=1
				s.pop(-1)
				if len(s)==0:
					d[c]+=1
					c=0
			else:
				s.append(")")
	#print(s)
#print(d)
if len(d)==0:
	print(*[0,1])
else:
	print(2*max(d),d[max(d)])