#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long int inf64 = 1e18 + 5;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, i;
  string second;
  cin >> second;
  n = second.size();
  long long int e[n], o[n];
  int lasta = -1, lastb = -1;
  for (int i = 0, j = 0; i < n; i = j) {
    while (j + 1 < n && second[j] == second[j + 1]) ++j;
    if (j < n) ++j;
    for (int k = i; k < j; k++) o[k] = e[k] = 0;
    o[i] = 1;
    if (second[i] == 'a' && lasta != -1) {
      int gp = i - lasta - 1;
      if (gp & 1) {
        o[i] += o[lasta];
        e[i] += e[lasta];
      } else {
        e[i] += o[lasta];
        o[i] += e[lasta];
      }
    } else if (second[i] == 'b' && lastb != -1) {
      int gp = i - lastb - 1;
      if (gp & 1) {
        o[i] += o[lastb];
        e[i] += e[lastb];
      } else {
        e[i] += o[lastb];
        o[i] += e[lastb];
      }
    }
    for (int k = i + 1; k < j; k++) {
      o[k] += e[k - 1] + 1;
      e[k] += o[k - 1];
    }
    second[i] == 'a' ? lasta = j - 1 : lastb = j - 1;
  }
  long long int even = accumulate(e, e + n, 0ll);
  long long int odd = accumulate(o, o + n, 0ll);
  cout << even << ' ' << odd << '\n';
}
