#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
void Solution() {
  string s;
  cin >> s;
  vector<int> a;
  for (long long i = 0; i < s.size(); i++) {
    a.push_back((s[i] == 'a') ? 0 : 1);
  }
  long long n = a.size();
  long long cnt0_odd = 0;
  long long cnt0_even = 0;
  long long cnt1_odd = 0;
  long long cnt1_even = 0;
  long long odd = n;
  long long even = 0;
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] == 0) {
      if (i % 2 == 0) {
        odd += cnt0_even;
        even += cnt0_odd;
        cnt0_even++;
      } else {
        odd += cnt0_odd;
        even += cnt0_even;
        cnt0_odd++;
      }
    } else {
      if (i % 2 == 0) {
        odd += cnt1_even;
        even += cnt1_odd;
        cnt1_even++;
      } else {
        odd += cnt1_odd;
        even += cnt1_even;
        cnt1_odd++;
      }
    }
  }
  cout << even << " " << odd << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  Solution();
  return 0;
}
