#include <iostream>
#include <cstdio>
#include <fstream>
#include <vector>
#include <string.h>
#define INF 9999999999999
using namespace std;
typedef long long lld;

lld cnt[2002], n;
vector<string> names;

lld Find(string name)
{
    lld i;

    for (i=0;i<names.size();i++)
    {
        if (names[i] == name) return i;
    }

    names.push_back(name);
    return (names.size()-1);
}

int main ()
{
    freopen("class.in","r",stdin);
    freopen("class.out","w",stdout);

    memset(cnt, 0, sizeof(cnt));
    lld i,j,ii,jj,ind;
    lld mx = -INF, mn = INF;

    string a;

    scanf("%lld",&n);
    for (i=1;i<=n;i++)
    {
        cin>>a;

        cnt[Find(a)]++;
    }

    for (i=0;i<names.size();i++)
    {
        if (mx < cnt[i]) mx = cnt[i];
        if (mn > cnt[i]) mn = cnt[i];
    }

    cout<<mx<<" "<<mn<<endl;
}