#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  stack<int> st;
  int l, i, j = -1, max = 0, c = 0, n = 1;
  l = s.size();
  for (i = 0; i < l; i++) {
    if (s[i] == '(')
      st.push(i);
    else if (st.empty())
      j = i;
    else {
      st.pop();
      c = i - (st.empty() ? j : st.top());
      if (c > max) {
        max = c;
        n = 1;
      } else if (c == max) {
        n++;
      }
    }
  }
  cout << max << ' ' << n;
  return 0;
}
