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>.
bs = input().strip()
n = len(bs)
prevs = [-1] * n
starts = [-1] * n

opens = []
for i, b in enumerate(bs):
	if b == '(':
		opens.append(i)
	else:
		if opens:
			j = opens.pop()
			prevs[i] = j
			starts[i] = max(j, starts[j-1])

best = 0
best_count = 1

for i, s in enumerate(starts):
	if s != -1:
		l = i - s + 1
		if l > best:
			best = l
			best_count = 1
		elif l == best:
			best_count += 1

print(best, best_count)