/* -*- coding: utf-8 -*-
 *
 * 457.cc: No.457 (^^*) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 10000;

/* typedef */

/* global variables */

int csums[4][MAX_N + 1];

/* subroutines */

/* main */

int main() {
  string s;
  cin >> s;
  int n = s.size();

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 4; j++) csums[j][i + 1] = csums[j][i];
    switch (s[i]) {
    case '(': csums[0][i + 1]++; break;
    case '^': csums[1][i + 1]++; break;
    case '*': csums[2][i + 1]++; break;
    case ')': csums[3][i + 1]++; break;
    }
  }

  int lsum = 0, rsum = 0;
  for (int i = 0; i < n; i++)
    if (s[i] == '(') {
      int i0 =
	lower_bound(csums[1], csums[1] + n + 1, csums[1][i + 1] + 2)
	- csums[1];
      if (i0 <= n) {
	int j0 =
	  lower_bound(csums[2], csums[2] + n + 1, csums[2][i0] + 1)
	  - csums[2];
	if (j0 <= n) lsum += csums[3][n] - csums[3][j0];
      }

      int i1 =
	lower_bound(csums[2], csums[2] + n + 1, csums[2][i + 1] + 1)
	- csums[2];
      if (i1 <= n) {
	int j1 =
	  lower_bound(csums[1], csums[1] + n + 1, csums[1][i1] + 2)
	  - csums[1];
	if (j1 <= n) rsum += csums[3][n] - csums[3][j1];
      }
    }

  printf("%d %d\n", lsum, rsum);
  return 0;
}