CodeForces 180C Letter (水)

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<=(z);(x)++)
#define per(x,y,z) for(int (x)=(y);(x)>=(z);(x)--)

#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+10;
const int maxm=2e5+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
string s;
int dp1[maxn],dp2[maxn];
int main(){
    cin>>s;s=' '+s;
    int len=s.size();
    rep(i,1,len){
        dp1[i]=dp1[i-1];
        if(s[i]<='z'&&s[i]>='a') dp1[i]++;
    }
    per(i,len,1){
        dp2[i]=dp2[i+1];
        if(s[i]<='Z'&&s[i]>='A') dp2[i]++;
    }
    int ans=dp2[1];
    rep(i,1,len) ans=min(ans,dp1[i]+dp2[i+1]);
    cout<<ans;
    return 0;
}