C language - word analysis

Title Description

Xiao Lan is learning a magical language , Words in this language are made up of lowercase English letters become , Some words are long , Far more than the length of normal English words . Xiao Lan has been learning for a long time and can't remember some words , He is not going to memorize these words completely , But to distinguish words according to which letter appears most .

Now? , Please help Xiao Lan , After giving a word , Help him find the letters that appear most and this The number of times a letter appears .

Input description

Enter a line containing one word , Words consist only of lowercase English letters .

For all the evaluation cases , The length of the entered word does not exceed 1000.

Output description

Output two lines , The first line contains an English letter , Indicates which letter appears most in a word individual . If more than one letter appears the same number of times , The one with the smallest output dictionary order .

The second line contains an integer , Indicates the number of times the letter that appears most often appears in the word .

I/o sample

Example 1

Input

lanqiao

Output

a
2

Example 2

Input

longlonglongistoolong

Output

o
6

#include <stdio.h>
#include <stdlib.h>

int read(char *str);
int main(int argc, char *argv[])
{
  //  Please enter your code here 
  char str[1000];
  scanf("%s",str);
  read(str);
  return 0;
}

int read(char *str)
{
  int i=0,j=0,max=0,max1=0;
  char zimu[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
  int count[26]={0};
  for(i=0;i<26;i++){
    for(j=0;str[j]!='\0';j++){
      if(zimu[i]==str[j])
      count[i]++;
    }
  }
  for(i=0;i<26;i++)
  {
    if(count[i]>max)
    {
      max=count[i];
      max1=i;
    }
  }
  printf("%c\n",zimu[max1]);
  printf("%d",max);
  return 0;
}

 

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[])
{
  //  Please enter your code here 
  int count[26]={0},max=0,i;
  char ch;
  while((ch=getchar())!='\n')
    count[ch-'a']++;
  for(i=1;i<26;i++)
    if(count[i]>count[max])
      max=i;
  printf("%c\n%d",max+'a',count[max]);
  return 0;
}