#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
const int INF=0x3f3f3f3f;
#define mem(x,y) memset(x,y,sizeof(x))
#define SI(x) scanf("%d",&x)
#define PI(x) printf("%d",x)
#define SD(x,y) scanf("%lf%lf",&x,&y)
#define P_ printf(" ")
const int MAXN=110;
typedef long long LL;
int dp[2][MAXN];
bool is_bigalpha(char c){
	if(c>=‘A‘&&c<=‘Z‘)return true;
	else return false;
}
int main(){
	int T;
	char s[MAXN];
	SI(T);
	while(T--){
		mem(dp,0);
		scanf("%s",s+1);
		int len=strlen(s+1);
		dp[0][0]=0;
		dp[1][0]=1;
		for(int i=1;i<=len+1;i++){
			if(is_bigalpha(s[i])){
				dp[0][i]=min(dp[0][i-1]+2,dp[1][i-1]+2);
				dp[1][i]=min(dp[0][i-1]+2,dp[1][i-1]+1);
			}
			else{
				dp[0][i]=min(dp[0][i-1]+1,dp[1][i-1]+2);
				dp[1][i]=min(dp[0][i-1]+2,dp[1][i-1]+2);
			}
		}
		printf("%d\n",min(dp[0][len],dp[1][len]+1));
	}
	return 0;
}