#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
char a[N];
int main()
{
scanf("%s", a);
int len = strlen(a);
sort(a, a + len);
char c; //存储最长字符
int sum = 0; //存储字符出现的次数
for (int i = 0; i < len; i ++ )
{
int j = i;
while (j < len && a[j] == a[i]) j ++ ;
if (j - i > sum)
{
sum = j - i;
c = a[i];
}
i = j - 1;
}
cout << c << endl << sum << endl;
return 0;
}