Blue Bridge Cup real problem: 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

Operation limit

• Maximum operation time ：1s
• Maximum running memory : 256M

#include <iostream>
using namespace std;
int main()
{
  //  Please enter your code here 
  int num[26]{0};
  string s;
  cin>>s;
  int max=0;
  char c='a';
  for(char &ch : s)
  {
    int index=ch-'a';
    num[index]++;
  }
  for(int i=0;i<26;++i)
  {
    if(num[i]>max)
    {
      max=num[i];
      c='a'+i;
    }
    else if(num[i]==max&&'a'+i<c)
    {
      c='a'+i;
    }
  }
  cout<<c<<endl<<max;
  return 0;
}

Here, you should pay attention to which character is selected for the same number of times , Be careful ~