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>.
# -*- coding:utf-8 -*-

"""

created by shuangquan.huang at 1/6/20

"""

import collections
import time
import os
import sys
import bisect
import heapq
from typing import List


def solve(s):
    maxsize, subs = 0, 0
    c, a = 0, 0
    for i, v in enumerate(s):
        if v == '(':
            c += 1
        else:
            c -= 1
            if c >= 0:
                a += 1
            
        if c <= 0:
            c = 0
            if a > 0:
                if a > maxsize:
                    maxsize = a
                    subs = 1
                elif a == maxsize:
                    subs += 1
    if a > maxsize:
        maxsize = 1
        subs = 1
    elif a == maxsize:
        subs += 1
    
    return maxsize, subs
            
            


s = input()
a, b = solve(s)
print('{} {}'.format(a, b))