#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

string S;
int L[4], R[4];
int LEFT=0, HAT1=1, HAT2=2, STAR=3;

void solve() {
    cin>>S;
    int l=0, r=0;
    REP(i,S.size()) {
        char c = S[i];
        {
            if (c=='(') L[LEFT]++;
            if (c=='^') L[HAT2] = L[HAT1], L[HAT1] = L[LEFT];
            if (c=='*') L[STAR] = L[HAT2];
            if (c==')') l += L[STAR];
        }
        {
            if (c=='(') R[LEFT]++;
            if (c=='*') R[STAR] = R[LEFT];
            if (c=='^') R[HAT2] = R[HAT1], R[HAT1] = R[STAR];
            if (c==')') r += R[HAT2];
        }
    }
    out("%lld %lld\n", l, r);
}