package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	s := getNextString(scanner)
	n := len(s)
	ee := make([]int, n+1)
	for i := n - 1; i >= 0; i-- {
		if s[i] == ')' {
			ee[i]++
		}
	}
	for i := n - 1; i >= 0; i-- {
		ee[i] += ee[i+1]
	}
	var left, right int
	ll := map[byte][]int{}
	ll['*'] = fromright(s, '*')
	ll['^'] = fromright(s, '^')
	ll[')'] = fromright(s, ')')
	right += getright(s, ee, ll, [4]byte{'*', '^', '^', ')'})
	left += getright(s, ee, ll, [4]byte{'^', '^', '*', ')'})

	fmt.Fprintln(writer, fmt.Sprintf("%d %d", left, right))
}

func fromright(s string, target byte) []int {
	n := len(s)
	last := map[byte]int{
		'(': n,
		'^': n,
		'*': n,
		')': n,
	}
	ll := make([]int, n)
	for i := n - 1; i >= 0; i-- {
		ll[i] = last[target]
		last[s[i]] = i
	}
	return ll
}
func getright(s string, ee []int, ll map[byte][]int, cc [4]byte) int {
	var right int
	n := len(s)
	for i := 0; i < n; i++ {
		if s[i] != '(' {
			continue
		}
		j := ll[cc[0]][i]
		if j == n {
			continue
		}
		j = ll[cc[1]][j]
		if j == n {
			continue
		}
		j = ll[cc[2]][j]
		if j == n {
			continue
		}
		j = ll[cc[3]][j]
		if j == n {
			continue
		}
		right += ee[j]
	}
	return right
}