#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define N 1111111
ll m, v[N], vis[N], pre[N], mp[1111], tr[1111] = {' ', 'T', 'A', 'C'}, n, pos, ans, t[4];
char c[N];
queue<int> q[4];
int main(){
	mp['T'] = 1;
	mp['A'] = 2;
	mp['C'] = 3;
	scanf("%lld", &m);
	while(m--){
		for(int i = 0 ; i < 4 ; i++){
			while(q[i].size())
				q[i].pop();
			t[i] = 0;
		}
		scanf("%s", c + 1);
		n = strlen(c + 1);
		for(int i = 1 ; i <= n ; i++)
			pre[i] = i, vis[i] = 0;
		pos = ans = 0;
		for(int i = 1 ; i <= n ; i++)
			if(mp[c[i]])
				v[++pos] = mp[c[i]];
		n = pos;
		reverse(v + 1, v + 1 + pos);
		for(int i = 1 ; i <= n ; i++){
			if(v[i] == 1){
				q[0].push(i);
			}
			else if(v[i] == 2){
				if(q[0].size()){
					pre[i] = q[0].front();
					q[0].pop();
					q[1].push(i);
				}
			}
			else{
				if(q[1].size()){
					vis[q[1].front()] = vis[pre[q[1].front()]] = vis[i] = true;
					ans++;
					q[1].pop();
					q[2].push(i);
				}
			}
			/*
			printf("%lld:%lld %lld %lld %lld\n", v[i], t[0], t[1], t[2], t[3]);
			//*/
		}
		for(int i = 1 ; i <= n ; i++)
			if(!vis[i]){
				if(v[i] == 1){
					if(t[1])
						t[1]--, ans++;
					else
						t[0]++;
				}
				else{
					if(t[0])
						t[0]--, t[1]++;
				}
			}
		/*
		for(int i = 1 ; i <= pos ; i++)
			printf("%lld%c", vis[i], " \n"[i == pos]);
		for(int i = 1 ; i <= pos ; i++)
			printf("%lld%c", v[i], " \n"[i == pos]);
		//*/
		printf("%lld\n", ans);
	}
	return 0;
}
/*
0:......T
1:......T A
2:......T A C
3:......T A T

4
CATAT
TACT
CACATT
CGGATACGAATCTCG
1
1
2
2

TATATT
TATATTATATTTAT
TA(T?)
TATTAATTT
TTTAATTAT
*/