#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
char buf[maxn];
long long sum[maxn][2][2];
int len;
int main() {
  scanf("%s", buf + 1);
  len = strlen(buf + 1);
  sum[0][0][0] = sum[0][0][1] = sum[0][1][0] = sum[0][1][1] = 0;
  for (int i = 1; i <= len; ++i) {
    int t = buf[i] == 'a';
    sum[i][0][0] = sum[i - 1][0][0];
    sum[i][0][1] = sum[i - 1][0][1];
    sum[i][1][0] = sum[i - 1][1][0];
    sum[i][1][1] = sum[i - 1][1][1];
    sum[i][t][i % 2]++;
  }
  long long res1 = 0, res2 = 0;
  for (int i = 1; i <= len; ++i) {
    int t = buf[i] == 'a';
    res1 += sum[len][t][i % 2] - sum[i - 1][t][i % 2];
    res2 += sum[len][t][(i % 2) ^ 1] - sum[i][t][(i % 2) ^ 1];
  }
  printf("%lld %lld\n", res2, res1);
  return 0;
}
