#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[N], ct[N];
signed main() {
  string s;
  cin >> s;
  int n = s.length();
  fill(a, a + N, -1);
  stack<int> stk;
  for (int i = 0; i < n; i++) {
    if (s[i] == '(')
      stk.push(i);
    else {
      if (!stk.empty()) {
        int top = stk.top();
        a[i] = top;
        stk.pop();
        if (top > 0 and a[top - 1] != -1) a[i] = a[top - 1];
      }
    }
  }
  int mx = 0;
  for (int i = 0; i < n; i++)
    if (a[i] != -1) {
      ct[i - a[i] + 1]++;
      mx = max(mx, i - a[i] + 1);
    }
  ct[0] = 1;
  cout << mx << " " << ct[mx] << "\n";
}
