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>
using namespace std;
char s[1 << 20];
int main() {
  int n, m, c, b;
  stack<int> l;
  scanf("%s", s);
  n = 0;
  c = 1;
  b = -1;
  for (int i = 0; s[i] != '\0'; ++i) {
    if (s[i] == '(') {
      l.push(i);
    } else if (l.empty()) {
      b = i;
    } else {
      l.pop();
      m = i - (l.empty() ? b : l.top());
      if (n < m) {
        n = m;
        c = 1;
      } else if (m == n) {
        ++c;
      }
    }
  }
  printf("%d %d\n", n, c);
  return 0;
}