from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
from fractions import Fraction
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

s=SI()
cntl=[0]*5
cntr=[0]*5
for c in s:
    if c==")":
        cntl[4]+=cntl[3]
        cntr[4]+=cntr[3]
    if c=="*":
        cntr[1]+=cntr[0]
        cntr[0]=0
        cntl[3]+=cntl[2]
        cntl[2]=0
    if c=="^":
        cntr[3]+=cntr[2]
        cntr[2]=cntr[1]
        cntr[1]=0
        cntl[2]+=cntl[1]
        cntl[1]=cntl[0]
        cntl[0]=0
    if c=="(":
        cntl[0]+=1
        cntr[0] += 1
print(cntl[4],cntr[4])