#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%Ld"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#include <utility>
#include <cassert>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
map<string , int> cnt;
int N;
char buf[1000];
int main(){
  freopen("class.in" , "r" , stdin);
  freopen("class.out" , "w" , stdout);
  scanf("%d" , &N);
  for(int i=0;i<N;++i){
   scanf("%s" , &buf);
   ++cnt[string(buf)];
                      }
  int MAX = cnt.begin()->se , MIN = MAX;
  for(map<string,int>::iterator it = cnt.begin();
      it != cnt.end();
      ++it){
   relaxMax(MAX , it->se);
   relaxMin(MIN , it->se);
           }
  cout<<MAX<<' '<<MIN<<'\n';
  return 0;
}