#include <bits/stdc++.h>
using i64 = long long;
std::pair<i64, i64> count_good_substrings(const std::string& string) {
  std::pair<i64, i64> result, current;
  for (int i = 0; i < string.size(); ++i) {
    if (i > 0 && string[i - 1] != string[i]) {
      current.first = (i / 2) - current.first;
      current.second = ((i - 1) / 2 + 1) - current.second;
    }
    std::swap(current.first, current.second);
    ++current.second;
    result.first += current.first;
    result.second += current.second;
  }
  return result;
}
int main() {
  std::string string;
  std::cin >> string;
  const auto [even_count, odd_count] = count_good_substrings(string);
  std::cout << even_count << ' ' << odd_count << '\n';
  return 0;
}
