#include <bits/stdc++.h>
using namespace std;
long long aeven, aodd, beven, bodd, anseven, ansodd;
long long noweven[100010], nowodd[100010];
bool f;
int main() {
  int n, cnt = 0, now;
  long long neven, nodd;
  int s[100010];
  char ch[100010];
  scanf("%s", ch);
  n = strlen(ch);
  for (int i = 1; i < n; i++)
    if (ch[i] != ch[i - 1]) s[++cnt] = i;
  s[++cnt] = n;
  f = 0;
  for (int i = 1; i <= cnt; i++) {
    now = s[i] - s[i - 1];
    for (int j = 1; j <= now; j++) {
      if (j % 2 == 1) {
        ansodd += j / 2 + 1;
        anseven += j / 2;
      } else {
        ansodd += j / 2;
        anseven += j / 2;
      }
    }
    noweven[i] = nowodd[i] = now / 2;
    if (now % 2 != 0) {
      if (s[i] % 2 == 0)
        noweven[i]++;
      else
        nowodd[i]++;
    }
    if (!f) {
      neven = aeven;
      nodd = aodd;
    } else {
      neven = beven;
      nodd = bodd;
    }
    anseven += noweven[i] * nodd + nowodd[i] * neven;
    ansodd += noweven[i] * neven + nowodd[i] * nodd;
    if (i == 1) {
      f = 1;
      continue;
    }
    if (!f) {
      beven += noweven[i - 1];
      bodd += nowodd[i - 1];
    } else {
      aeven += noweven[i - 1];
      aodd += nowodd[i - 1];
    }
    f ^= 1;
  }
  printf("%I64d %I64d\n", anseven, ansodd);
  return 0;
}
