#include <bits/stdc++.h>
using namespace std;
long long P = 998244353;
const int sqr = 500;
const int arrn = 1e6 + 5;
const int arrn2 = 5e3 + 5;
void solve() {
  string inp;
  cin >> inp;
  int n;
  n = inp.length();
  vector<int> in(n, 0);
  vector<vector<long long>> ans(n, vector<long long>(2, 0));
  for (int i = 0; i < n; i++) {
    char k = inp[i];
    in[i] = (k == 'a');
  }
  for (int i = n - 1; i >= 0; i--) {
    int ind = i + 1;
    while (ind < n && in[ind] != in[i]) ind++;
    if (ind == n) {
      ans[i][1] = 1;
    } else {
      int len = ind - i - 1;
      if (len % 2 == 0) {
        ans[i][0] = ans[ind][1];
        ans[i][1] = ans[ind][0] + 1;
      } else {
        ans[i][1] = ans[ind][1] + 1;
        ans[i][0] = ans[ind][0];
      }
    }
  }
  long long even = 0, odd = 0;
  for (int i = 0; i < n; i++) {
    even += ans[i][0];
    odd += ans[i][1];
  }
  cout << even << ' ' << odd;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
