#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int width,height;
int m,n;

ll dp[10010];
string str;

// (^^*)
ll dfsL(int pos=0,int stage=0){
    static map<int,ll> memo;
    if (n<=pos) return 0;
    
    int key = pos|(stage<<24);
    if (memo.count(key)) return memo[key];
    
    ll result = 0;
    
    if (stage == 0){
        if (str[pos]=='('){
            result+=dfsL(pos+1,stage+1);
        }
        result+=dfsL(pos+1,stage);
    }else if (stage == 1 || stage == 2){
        if (str[pos]=='^'){
            result+=dfsL(pos+1,stage+1);
        }else{
            result+=dfsL(pos+1,stage);
        }
    }else if (stage == 3){
        if (str[pos] == '*'){
            result+=dfsL(pos+1,stage+1);
        }else{
            result+=dfsL(pos+1,stage);
        }
    }else if (stage == 4){
        if (str[pos] == ')'){
            result++;
        }
        result+=dfsL(pos+1,stage);
    }
    return memo[key] = result;
}

// (*^^)
ll dfsR(int pos=0,int stage=0){
    static map<int,ll> memo;
    if (n<=pos) return 0;
    
    int key = pos|(stage<<24);
    if (memo.count(key)) return memo[key];
    
    ll result = 0;
    
    if (stage == 0){
        if (str[pos]=='('){
            result+=dfsR(pos+1,stage+1);
        }
        result+=dfsR(pos+1,stage);
    }else if (stage == 1){
        if (str[pos] == '*'){
            result+=dfsR(pos+1,stage+1);
        }else{
            result+=dfsR(pos+1,stage);
        }
    }else if (stage == 2 || stage == 3){
        if (str[pos]=='^'){
            result+=dfsR(pos+1,stage+1);
        }else{
            result+=dfsR(pos+1,stage);
        }
    }else if (stage == 4){
        if (str[pos] == ')'){
            result++;
        }
        result+=dfsR(pos+1,stage);
    }
    
    return memo[key] = result;
}


int main(){
    int i,j,k;
    ll x,y,a,b;
    
    cin >> str;
    n = str.size();
    
    a = dfsL();
    b = dfsR();
    
    printf("%lld %lld\n",a,b);

    return 0;
}