#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int calc(string s){
    int n = s.length();
    VVI dp(n+1, VI(5));
    REP(i,n){
        if (s[i] == '('){
            dp[i+1][0] = dp[i][0] + 1;
            dp[i+1][1] = dp[i][1];
            dp[i+1][2] = dp[i][2];
            dp[i+1][3] = dp[i][3];
        }else if (s[i] == '*'){
            dp[i+1][1] = dp[i][1] + dp[i][0];
            dp[i+1][2] = dp[i][2];
            dp[i+1][3] = dp[i][3];
        }else if (s[i] == '^'){
            dp[i+1][0] = dp[i][0];
            dp[i+1][2] = dp[i][1];
            dp[i+1][3] = dp[i][3] + dp[i][2];
        }else{
            dp[i+1][0] = dp[i][0];
            dp[i+1][1] = dp[i][1];
            dp[i+1][2] = dp[i][2];
            dp[i+1][3] = dp[i][3];
            dp[i+1][4] = dp[i][3];
        }
    }
    int res = 0;
    REP(i,n+1) res += dp[i][4];
    return res;
}

int main() {
    string s;
    cin >> s;
    int a = calc(s);
    reverse(s.begin(), s.end());
    REP(i,s.length()){
        if (s[i] == '(') s[i] = ')';
        else if (s[i] == ')') s[i] = '(';
    }
    int b = calc(s);
    printf("%d %d\n", b, a);
    return 0;
}