HDU2577

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <list>
#include <cmath>

using namespace std;
#define cir(a,b) memset(a,b,sizeof a)
typedef long long  LL;
const int maxn = 100000+10;
int n;
int a[maxn],b[maxn];
char s[1111];
int main()
{
    cin >> n;
    while(n--)
    {
        cir(a,0),cir(b,0);
        scanf("%s", s+1);
        a[0] = 0;
        b[0] = 1;
        int k = 1;
        for(int i=1;s[i]!=0;i++)
        {
            if(s[i]>='a'&&s[i]<='z')
            {
                a[i] = min(a[i-1]+1,b[i-1]+2);
                b[i] = min(a[i-1]+2,b[i-1]+2);
            }
            else
            {
                a[i] = min(a[i-1]+2,b[i-1]+2);
                b[i] = min(a[i-1]+2,b[i-1]+1);
            }
            k = i;
        }
        cout << min(a[k],b[k]+1) << endl;
    }
    return 0;
}