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>.
x=input().strip()
c=-1
l=0
mx=0
ansmx=0
z=0
for i in x:
	if i=='(':
		if(c==-1):
			c=1
			z=1
		else:
			z=z+1
			c=c+1
		
	elif i==')':		
		if c>0:
			c=c-1
			z=z+1
		else:
			c=-1
			
		if(c==0):
			mx=max(mx,z);
			l=l+1
			z=0

if mx==0:
	print("0 1")
else:
	print(mx,l)
		 
