#include <iostream>
#include <stdio.h>
#include <map>
#include <string.h>
#include <algorithm>
using namespace std;

int MIN(int a,int b)
{
    if (a<b)
    return a;
    else
    return b;
}

struct student
{
    char name[11];
    int L;

    bool operator<( const student& other ) const
    {
        int i;

        for (i=0;i<MIN(L,other.L);i++)
        {
            if (name[i]<other.name[i])
            return true;
            else if (name[i]>other.name[i])
            return false;
        }

        return L<other.L;
    }
};

student students[2001];
int n;

bool Equal(int i,int j)
{
    if ( !(students[i]<students[j]) && !(students[j]<students[i]) )
    return true;
    else
    return false;
}

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

    int i,j;
    int curlen=1;
    int minlen=-1,maxlen=0;

    scanf("%d",&n);

    for (i=1;i<=n;i++)
    {
        scanf("%s",students[i].name);
        students[i].L=strlen(students[i].name);
    }

    sort(students+1,students+1+n);

    for (i=2;i<=n;i++)
    {
        if (Equal(i,i-1))
        {
            curlen++;
        }
        else
        {
            if (minlen==-1 || minlen>curlen)
            {
                minlen=curlen;
            }

            if (maxlen<curlen)
            {
                maxlen=curlen;
            }

            curlen=1;
        }
    }

    if (minlen==-1 || minlen>curlen)
    {
        minlen=curlen;
    }

    if (maxlen<curlen)
    {
        maxlen=curlen;
    }

    printf("%d %d\n",maxlen,minlen);

    return 0;
}
/**
12
Petar
Nadezda
Nadezda
Stoyan
Nadezda
Stoyan
Nadezda
Zdravko
Tsvetelina
Tsvetelina
Zdravko
Stoyan
**/