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>.
import sys
string=input()
def isReg(string):
	if len(string)%2!=0:
		return False
	chert=[]
	for i in string:
		if i=="(":
			chert.append("(")
		else:
			chert.append(")")
		if chert[len(chert)-1]==")" and chert[len(chert)-2]=="(":
			chert.pop(len(chert)-1)
			chert.pop(len(chert)-1)
	if not chert:
		return True
	return False
allSubs=[]
for i in range(0,len(string)):
	sub=string[i]
	for k in range(i+1,len(string)):
		sub+=string[k]
		if isReg(sub):
			allSubs.append(sub)
highestLen=0
for i in allSubs:
	if len(i)>highestLen:
		highestLen=len(i)
print(highestLen,end=' ')
answer=0
for i in allSubs:
	if len(i)==highestLen:
		answer+=1
if highestLen!=0:
	print(answer)
else:
	print(1)