#include<iostream>

#include<stack>

#include<cstdio>

#include<queue>

#include<cstring>

#include<algorithm>

#include<vector>

#include<set>

#include<map>

#include<string>

#include<cmath>

using namespace std;

typedef long long ll;

typedef pair<int,int> pp;

const int INF=0x3f3f3f3f;

const int N=10003;

int d1[N],d2[N];

int a[N];

char s[N*100];

int main()

{

    //freopen("data.in","r",stdin);

    int ln=0;

    char c;

    while(scanf("%c",&c)!=EOF)

    s[ln++]=c;

    int l=0;

    while(s[l]==' '&&l<ln)++l;

    int n=0;

    int k=0;

    for(int i=l;i<=ln;++i)

    {

        if((s[i]<='z'&&s[i]>='a')||(s[i]<='Z'&&s[i]>='A'))

        ++k;

        else

        {

            if(k>0)

            a[n++]=k;

            k=0;

        }

        if(i==ln) break;

    }

    memset(d1,0,sizeof(d1));

    memset(d2,0,sizeof(d2));

    d1[0]=a[0];d2[0]=0;

    for(int i=1;i<=n-1;++i)

    {

        d1[i]=a[i]+d2[i-1];

        d2[i]=max(d1[i-1],d2[i-1]);

    }

    cout<<max(d1[n-1],d2[n-1]);

    return 0;

}