#include<cstdio>

 #include<iostream>

 #define L ls[u]

 #define R rs[u]

 using namespace std;

 const int N = ;

 int ls[N],rs[N],dp1[N][],dp2[N][],pos = ;

 char s[N];

 void dfs(int u) {

     if (s[u] == '') return;

     if (s[u] == '' || s[u] == '') {

         L = ++pos;

         dfs(pos);

     }

     if (s[u] == '') {

         R = ++pos;

         dfs(pos);

     }

 }

 int tsl,tsr;

 void DP(int u) {

     if (!u) return ;

     dp1[u][] = ;dp1[u][] = dp1[u][] = ;

     dp2[u][] = ;dp2[u][] = dp2[u][] = ;

     DP(L);

     DP(R);

     dp1[u][] = max(dp1[L][] + dp1[R][], dp1[L][] + dp1[R][]) + ;

     dp1[u][] = max(dp1[L][] + dp1[R][], dp1[L][] + dp1[R][]);

     dp1[u][] = max(dp1[L][] + dp1[R][], dp1[L][] + dp1[R][]);

     dp2[u][] = min(dp2[L][] + dp2[R][], dp2[L][] + dp2[R][]) + ;

     dp2[u][] = min(dp2[L][] + dp2[R][], dp2[L][] + dp2[R][]);

     dp2[u][] = min(dp2[L][] + dp2[R][], dp2[L][] + dp2[R][]);

 }

 int main () {

     scanf("%s",s+);

     dfs();

 /*  for (int i=1; i<=n; ++i)

         cout << ls[i] << " "<< rs[i] << "\n";*/

     DP();

     cout << max(dp1[][],max(dp1[][],dp1[][])) << " ";

     cout << min(dp2[][],min(dp2[][],dp2[][]));

     return ;

 }