#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

string S;
int dp[10010][6];
int L;

int rec(const string keyword){
    memset(dp, 0, sizeof(dp));

    for(int i=0;i<L;++i){
        if(S[i] == keyword[0]){
            dp[i + 1][1] += 1;
        }

        for(int j=1;j<4;++j){
            if(S[i] == keyword[j]){
                dp[i + 1][j + 1] += dp[i][j];
            }else{
                dp[i + 1][j] += dp[i][j];
            }            
        }
        
        if(S[i] == keyword[4]){
            dp[i + 1][5] += dp[i][4];
        }
        dp[i + 1][4] += dp[i][4];
        dp[i + 1][5] += dp[i][5];
    }

    return dp[L][5];
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> S;
    L = S.size();
    
    int a = rec("(^^*)"), b = rec("(*^^)");
    std::cout << a << " " << b << std::endl;
}