#include<iostream>#include<stdio.h>#include<stdlib.h>#include<vector>#include<stack>#include<set>#include<map>#include<math.h>#include<queue>#include<algorithm>#define MAX 999999999typedeflonglong ll;
using namespace std;int n,m,k;
map<string,int>ma;intvali(char x){if(x >='0'&& x <='9')return1;if(x >='a'&& x <='z')return1;if(x >='A'&& x <='Z')return1;return0;}intmain(){
string s;getline(cin,s);int len = s.size();
string temp ="";for(int i =0;i<len;i++){if(vali(s[i]))
temp +=tolower(s[i]);elseif(!vali(s[i])&& temp !=""){
ma[temp]++;
temp ="";}}
ma[temp]++;
m =-1;
string ans ;for(auto it = ma.begin(); it != ma.end(); it++){if(it->second > m){
m = it->second;
ans = it->first;}}
cout<<ans<<" "<<m;return0;}