Problem: 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.

Input

The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. Its length does not exceed 106.

Output

Print the length of the longest substring that is a regular bracket sequence, and the number of such substrings. If there are no such substrings, write the only line containing "0 1".

Examples

Input

)((())))(()())


Output

6 2


Input

))(


Output

0 1

Solution (in PYTHON):

Solution:
ln = raw_input()
ans = 0;cnt = 1
st = [1]
for kh in ln:
    if kh == '(':
        st.append(1)
    elif len(st) < 2:
            st[0] = 1
    else:
        st[-1] += 1
        st[-2] += st[-1]
        st.pop()
        if st[-1]-1 > ans:
            ans = st[-1]-1
            cnt = 1
        elif st[-1]-1 == ans:
            cnt += 1
print ans, cnt