#include <stdio.h>

typedef struct node{
    char ch;
    int cnt;
}count_ch;

int main()
{
    char str[1005];
    gets(str);
    int i,j,k,l;
    count_ch cnt[26];
    int cnt_ch = 0;
    int cnt_word = 1;
    int max_ch[26] = {0};
    for(i=0;str[i]!='\0';i++)
    {
        if(str[i]>='A'&&str[i]<='Z')
        {
            str[i] += 32;
        }
    }
    for(i=0;str[i]!='\0';i++)
    {
        if(str[i]==' ')
        {
            ++cnt_word;
        }
        else
        {
            ++cnt_ch;
        }
        if(str[i]>='a'&&str[i]<='z')
        {
            max_ch[str[i]-'a']++;
        }
    }
    printf("%d\n%d\n",cnt_ch,cnt_word);
    
    for(i=0;i<26;i++)
    {
        cnt[i].ch = 'a'+i;
        cnt[i].cnt = max_ch[i];
    }
    count_ch max;
    int temp = 0;
    for(i=0;i<26;i++)
    {
        if(temp<cnt[i].cnt)
        {
            max = cnt[i];
            temp = ...