#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <numeric>
#include <cassert>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <random>
#include <vector>
#include <iostream>
#include <string>
#include <complex>
#include <functional>
#pragma warning(disable:4146)

#define FOR(k,a,b) for(uint k(a); k < (b); ++k)
#define REP(k,a) for(int k=0; k < (a); ++k)
#define ABS(a) ((a)>0?(a):-(a))

using namespace std;

typedef long long LL;
typedef unsigned int uint;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<VI> VVI;
typedef vector<VD> VVD;
typedef vector<vector<bool> > VVB;

int main(int argc, char** argv) {
#ifdef HOME
	freopen("VILTRIBE_0.in", "rb", stdin);
	freopen("out.txt", "wb", stdout);
#endif
	int T,res[2], pos;
	char* s = new char[100005], *p, last;
	scanf("%d", &T);
	assert(T > 0 && T <= 20);
	REP(tc,T)
	{
		scanf("%s", s);
		assert(strlen(s) > 0 && strlen(s) <= 100000);
		res[0] = res[1] = 0;
		pos = -1;
		p = s; 
		last = ' ';
		while(*p)
		{
			char c = *p++;
			if(c == '.')
				continue;
			if(last == c)
			{
				res[c - 'A'] += (p - s - 1) - pos;
			}
			else
			{
				res[c - 'A']++;
			}
			last = c;
			pos = p - s - 1;
		}
		printf("%d %d\n", res[0], res[1]);
	}
	delete[] s;
	return 0;
}