import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const S = readToken();
      const L = cast(int)(S.length);
      
      auto rs = new int[L + 1];
      foreach_reverse (i; 0 .. L) {
        rs[i] = ((S[i] == ')') ? 1 : 0) + rs[i + 1];
      }
      auto nexts = new int[][](2, L + 1);
      foreach (a; 0 .. 2) {
        nexts[a][L] = L;
        foreach_reverse (i; 0 .. L) {
          nexts[a][i] = (S[i] == "^*"[a]) ? i : nexts[a][i + 1];
        }
      }
      
      long ans0, ans1;
      foreach (i; 0 .. L) {
        if (S[i] == '(') {
          {
            int j = i + 1;
            j = nexts[0][j] + 1;
            if (j > L) goto failed0;
            j = nexts[0][j] + 1;
            if (j > L) goto failed0;
            j = nexts[1][j] + 1;
            if (j > L) goto failed0;
            ans0 += rs[j];
           failed0:
          }
          {
            int j = i + 1;
            j = nexts[1][j] + 1;
            if (j > L) goto failed1;
            j = nexts[0][j] + 1;
            if (j > L) goto failed1;
            j = nexts[0][j] + 1;
            if (j > L) goto failed1;
            ans1 += rs[j];
           failed1:
          }
        }
      }
      writeln(ans0, " ", ans1);
    }
  } catch (EOFException e) {
  }
}