def solve(S):
    L = count_faces(S[::-1], ')(')
    R = count_faces(S)
    return L, R

def count_faces(S, parens = '()'):
    n = len(S)
    open_paren = parens[0]
    close_paren = parens[1]
    next_star_pos = set_next_pos(S, '*')
    cums_hat = set_cum_count(S, '^')
    cums_paren = set_cum_count(S, close_paren)
    counts = 0
    right_idx = 1
    for left_idx, c in enumerate(S):
        if c == open_paren:
            star_pos = next_star_pos[left_idx]
            if star_pos  >= n:
                break
            for right_idx in range(right_idx, n):
                if S[right_idx] == close_paren:
                    if cums_hat[right_idx] - cums_hat[star_pos] >= 2:
                        break
            else:
                break
            counts += cums_paren[-1] - cums_paren[right_idx] + 1
    return counts


def set_next_pos(S, c):
    n = len(S)
    nps = [n] * n
    np = n
    for pos in range(n - 1, -1, -1):
        if S[pos] == c:
            np = pos
        nps[pos] = np
    return nps

def set_cum_count(S, c):
    n = len(S)
    cums = [0] * n
    cum = 0
    for pos, s in enumerate(S):
        if s == c:
            cum += 1
        cums[pos] = cum
    return cums

S = input().rstrip()
print(*solve(S))