#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


char S[100'010];
int cur;
void eat(char tar) {
  if (S[cur] != tar) cerr << "[eat] FAIL " << cur << " " << S[cur] << " " << tar << endl;
  assert(S[cur] == tar);
  ++cur;
}

/*
⟨expr⟩ ::= ⟨term⟩ | ⟨expr⟩ ‘+’ ⟨term⟩
⟨term⟩ ::= ⟨factor⟩ | ⟨term⟩ ‘*’ ⟨factor⟩
⟨factor⟩ ::= ‘N’ | ‘N^’ ⟨number⟩ | ‘log(’ ⟨expr⟩ ‘)’ | ‘log(’ ⟨expr⟩ ‘)^’ ⟨number⟩ | ‘(’ ⟨expr⟩ ‘)’
⟨number⟩ ::= ⟨nonzero_digit⟩ | ⟨nonzero_digit⟩⟨digit_string⟩
⟨digit_string⟩ ::= ⟨digit⟩ | ⟨digit⟩⟨digit_string⟩
⟨nonzero_digit⟩ ::= ‘1’ | ‘2’ | ‘3’ | ‘4’ | ‘5’ | ‘6’ | ‘7’ | ‘8’ | ‘9’
⟨digit⟩ ::= ‘0’ | ⟨nonzero_digit⟩
*/
using P = pair<Int, pair<Int, Int>>;
P expr();
P term();
P factor();
Int number();

P expr() {
  P ret = term();
  for (; S[cur] == '+'; ) {
    eat('+');
    const P tmp = term();
    chmax(ret, tmp);
  }
  return ret;
}
P term() {
  P ret = factor();
  for (; S[cur] == '*'; ) {
    eat('*');
    const P tmp = factor();
    ret.first += tmp.first;
    ret.second.first += tmp.second.first;
    ret.second.second += tmp.second.second;
  }
  return ret;
}
P factor() {
  P ret;
  if (S[cur] == 'N') {
    eat('N');
    Int e;
    if (S[cur] == '^') {
      eat('^');
      e = number();
    } else {
      e = 1;
    }
    ret = P(e, make_pair(0, 0));
  } else if (S[cur] == 'l') {
    eat('l');
    eat('o');
    eat('g');
    eat('(');
    const P tmp = expr();
    eat(')');
    Int e;
    if (S[cur] == '^') {
      eat('^');
      e = number();
    } else {
      e = 1;
    }
    ret = P(0, make_pair(tmp.first ? e : 0, (tmp.second.first + tmp.second.second) ? 1 : 0));
  } else {
    eat('(');
    ret = expr();
    eat(')');
  }
  return ret;
}
Int number() {
  Int x = 0;
  for (; isdigit(S[cur]); ) {
    (x *= 10) += (S[cur++] - '0');
  }
  return x;
}

int main() {
  for (; ~scanf("%s", S); ) {
    cur = 0;
    const auto ans = expr();
    printf("%lld %lld\n", ans.first, ans.second.first + ans.second.second);
  }
  return 0;
}