#include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;
 
#define EPS 1e-8
 
int main(){
 
	map<string, int> mp;
 
	int maxi = 0;
	string s;
	string longest = "";
	while(cin >> s){
		mp[s]++;
		maxi = max(maxi, mp[s]);
		if(longest.size() < s.size()) longest = s;
	}
 
	for(auto it : mp){
		if(maxi == it.second) cout << it.first;
	}
	cout << " " << longest << endl;
 
 
	return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAojZGVmaW5lIFJFUChpLHMsbikgZm9yKGludCBpPXM7aTxuOysraSkKI2RlZmluZSByZXAoaSxuKSBSRVAoaSwwLG4pCiNkZWZpbmUgU09SVChjKSBzb3J0KChjKS5iZWdpbigpLChjKS5lbmQoKSkKI2RlZmluZSBJSU5GIElOVF9NQVgKI2RlZmluZSBMTElORiBMTE9OR19NQVgKIAp0eXBlZGVmIGxvbmcgbG9uZyBsbDsKdHlwZWRlZiBwYWlyPGludCwgaW50PiBpaTsKCiNkZWZpbmUgRVBTIDFlLTgKCmludCBtYWluKCl7CgkKCW1hcDxzdHJpbmcsIGludD4gbXA7CgkKCWludCBtYXhpID0gMDsKCXN0cmluZyBzOwoJc3RyaW5nIGxvbmdlc3QgPSAiIjsKCXdoaWxlKGNpbiA+PiBzKXsKCQltcFtzXSsrOwoJCW1heGkgPSBtYXgobWF4aSwgbXBbc10pOwoJCWlmKGxvbmdlc3Quc2l6ZSgpIDwgcy5zaXplKCkpIGxvbmdlc3QgPSBzOwoJfQoJCglmb3IoYXV0byBpdCA6IG1wKXsKCQlpZihtYXhpID09IGl0LnNlY29uZCkgY291dCA8PCBpdC5maXJzdDsKCX0KCWNvdXQgPDwgIiAiIDw8IGxvbmdlc3QgPDwgZW5kbDsKCgkKCXJldHVybiAwOwp9

VGhhbmsgeW91IGZvciB5b3VyIG1haWwgYW5kIHlvdXIgbGVjdHVyZXM=

Thank you for your mail and your lectures