#include <bits/stdc++.h>
using namespace std;
const int mx2 = 505;
const int mx3 = 2005;
const int mx5 = 100005;
const int mx6 = 400005;
int _toggle(int N, int pos) { return N = N ^ (1 << pos); }
int _set(int N, int pos) { return N = N | (1 << pos); }
int _reset(int N, int pos) { return N = N & ~(1 << pos); }
bool _check(int N, int pos) { return (bool)(N & (1 << pos)); }
bool _upper(char a) { return a >= 'A' && a <= 'Z'; }
bool _lower(char a) { return a >= 'a' && a <= 'z'; }
bool _digit(char a) { return a >= '0' && a <= '9'; }
int dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int n, a[mx5], b[mx5], ca[2][mx5], cb[2][mx5], ia, ib;
string s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> s;
  n = s.size();
  for (int i = 0; i < n; i++) {
    if (s[i] == 'a') {
      a[ia++] = i;
    }
    if (s[i] == 'b') {
      b[ib++] = i;
    }
  }
  long long ans0 = 0, ans1 = 0;
  for (int i = ia - 1; i >= 0; i--) {
    if (a[i] % 2) {
      ca[1][i] = 1;
    } else {
      ca[0][i] = 1;
    }
    ca[0][i] += ca[0][i + 1];
    ca[1][i] += ca[1][i + 1];
  }
  for (int i = ib - 1; i >= 0; i--) {
    if (b[i] % 2) {
      cb[1][i] = 1;
    } else {
      cb[0][i] = 1;
    }
    cb[0][i] += cb[0][i + 1];
    cb[1][i] += cb[1][i + 1];
  }
  for (int i = 0; i < ia; i++) {
    if (a[i] % 2) {
      ans1 += 1LL * ca[1][i];
      ans0 += 1LL * ca[0][i];
    } else {
      ans1 += 1LL * ca[0][i];
      ans0 += 1LL * ca[1][i];
    }
  }
  for (int i = 0; i < ib; i++) {
    if (b[i] % 2) {
      ans1 += 1LL * cb[1][i];
      ans0 += 1LL * cb[0][i];
    } else {
      ans1 += 1LL * cb[0][i];
      ans0 += 1LL * cb[1][i];
    }
  }
  cout << ans0 << ' ' << ans1 << '\n';
}
