#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll ans=0;
  string s;cin >> s;ll n=s.size();
  vl dp(4);
  rep(i,n){
    if(s[i]=='(')dp[0]++;
    else if(s[i]=='^'){
      dp[2]+=dp[1];dp[1]=0;
      dp[1]+=dp[0];dp[0]=0;
    }
    else if(s[i]=='*'){
      dp[3]+=dp[2];dp[2]=0;
    }
    else ans+=dp[3];
  }
  cout << ans << " ";
  rep(i,4)dp[i]=0;
  ll ret=0;
  rep(i,n){
    if(s[i]=='(')dp[0]++;
    else if(s[i]=='^'){
      dp[3]+=dp[2];dp[2]=0;
      dp[2]+=dp[1];dp[1]=0;
    }
    else if(s[i]=='*'){
      dp[1]+=dp[0];dp[0]=0;
    }
    else ret+=dp[3];
  }
  cout << ret << endl;
}