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>.
s = input()
curr = 0
count = 0
mx = 0
t = 0
for i in range(len(s)):

	if s[i] == '(':
		t += 1
	else:
		if t == 0:
			curr = 0
		else:
			t -= 1
			curr += 2
			# count += 1
			if t == 0:
				count += 1
	mx = max(curr , mx)

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