#include <bits/stdc++.h>
using namespace std;
void calc(string S){
    int N=S.size();
    vector<int> nearest(N);
    int temp=N;
    for(int i=N-1;i>=0;i--){
        if(S[i]=='*'){
            temp=i;
        }
        nearest[i]=temp;
    }
    vector<int> nearest2(N);
    int temp2=N;
    temp=N;
    for(int i=N-1;i>=0;i--){
        if(S[i]=='^'){
            temp2=temp;
            temp=i;
        }
        nearest2[i]=temp2;
    }
    vector<int> nearest_merge(N);
    for(int i=0;i<N;i++){
        if(nearest[i]==N){
            nearest_merge[i]=N;
        }else{
            nearest_merge[i]=nearest2[nearest[i]];
        }
    }
    vector<int> end(N);
    temp=0;
    for(int i=N-1;i>=0;i--){
        if(S[i]==')'){
            ++temp;
        }
        end[i]=temp;
    }
    int ret=0;
    for(int i=0;i<N;i++){
        if(S[i]=='(' && nearest_merge[i]!=N){
            ret+=end[nearest_merge[i]];
        }
    }
    cout<<ret;
}

int main(){
    string S,T;
    cin>>S;
    T="";
    for(int i=S.size()-1;i>=0;i--){
        T+=S[i];
    }
    calc(T);
    cout<<" ";
    calc(S);
}