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>.
string = input().strip()
string =  string.replace(" ", "")
opening=[ '(' , '[' , '{' ]  
closing=[')'  , ']' , '}']
stack = list()
count = 0 
var = 0 
maxs= -9999999999
for x in string:
	if x in opening:
		stack.append(x)
	else:
		
		if   len(stack) !=0 and opening[closing.index(x)] == stack[-1]:
			
			stack.pop()
			count+=1
		elif   len(stack) !=0 and x == ')' and stack[-1] == ')':
			stack.append(x)
			maxs = max(count * 2 , maxs)
			var+=1
			count = 0
		else:
			stack.append(x)
if count > 0 :
	var+=1
print(maxs , var)