#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int dp[2][6][12525];
char s[12525];
char t[2][1252] = {"(*^^)", "(^^*)"};
int n;

int main(){
  scanf("%s",s);
  n = strlen(s);
  int lef=0, rig=0;
  REP(i,n){
    if(s[i]!='(')continue;
    int lit = 1, rit = 1;
    FOR(j,i+1,n){
      if(s[j]=='('){
        continue;
      }else if(s[j]==')'){
        lef += lit==4;
        rig += rit==4;
      }else{
        if(lit<4 && t[0][lit]==s[j])lit++;
        if(rit<4 && t[1][rit]==s[j])rit++;
      }
    }
  }
  printf("%d %d\n",rig,lef);
  return 0;
}