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 CPP):

Solution:
#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
int e[1000001], s[1000001], f[1000001];
int main() {
  string st;
  stack<int> stk;
  int mx = 0;
  cin >> st;
  for (int i = 0; i < st.size(); i++) {
    char ch = st[i];
    if (ch == '(') {
      stk.push(i);
    } else {
      if (stk.empty()) {
        s[i] = e[i] = -1;
      } else {
        int idx = stk.top();
        stk.pop();
        s[i] = e[i] = idx;
        if (idx > 0 && st[idx - 1] == ')' && s[idx - 1] >= 0) e[i] = e[idx - 1];
        int l = i - e[i] + 1;
        f[l]++;
        mx = max(mx, l);
      }
    }
  }
  f[0] = 1;
  cout << mx << " " << f[mx];
  return 0;
}