#include<bits/stdc++.h>

using namespace std;

int n;

string cad;
int M1[26][26],M2[26][26], index1, index2;
map<string, int> MAP1, MAP2;
int scc1[26], scc2[26];
bool F1[26][26], F2[26][26];
int dx[4] = {0,1,0,-1}; 
int dy[4] = {1,0,-1,0};

int dfs1(int id_i, int id_j, int conn)
{
    if(M1[id_i][id_j]!=conn)
        return 0;
    if(id_i<0 || id_j<0 || id_i==n||id_j==n)
        return 0;
    if(F1[id_i][id_j])
        return 0;

    F1[id_i][id_j] = true;

    int scc = 1;
    for(int i=0;i<4;i++)
    {
        scc += dfs1(id_i+dx[i], id_j+dy[i], conn);
    }
    return scc;
}


int dfs2(int id_i, int id_j, int conn)
{
    if(M2[id_i][id_j]!=conn)
        return 0;
    if(id_i<0 || id_j<0 || id_i==n||id_j==n)
        return 0;
    if(F2[id_i][id_j])
        return 0;

    F2[id_i][ id_j] = true;

    int scc = 1;
    for(int i=0;i<4;i++)
    {
        scc += dfs2(id_i+dx[i], id_j+dy[i], conn);
    }
    return scc;
}



int main()
{
    cin>>n;


    memset(scc1, 0, sizeof scc1);
    memset(scc2, 0, sizeof scc2);
    index1=0, index2=0;

    for (int i=0; i<n; i++)
    {
        for(int j=0; j<2*n; j++)
        {
            cin>>cad;
            if(j%2==0)
            {
                if(MAP1.count(cad)==0)
                    MAP1[cad] = index1++;
                M1[i][j/2] = MAP1[cad];
                //cout<<MAP1[cad]<<" ";
            }
            else
            {
                if(MAP2.count(cad)==0)
                    MAP2[cad] = index2++;
                M2[i][j/2] = MAP2[cad];
                //cout<<MAP2[cad]<<" ";
            }
        }
    }


//    for(int i=0; i<n;i++)
//    {
//        for(int j=0; j<n;j++)
//            cout<<M1[i][j]<<" ";
//        cout<<endl;
//    }
//
//    for(int i=0; i<n;i++)
//    {
//        for(int j=0; j<n;j++)
//            cout<<M2[i][j]<<" ";
//        cout<<endl;
//    }
//

    memset(F1, false, sizeof F1);
    memset(F2, false, sizeof F2);
    int val1=0, val2=0;

    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(F1[i][j] == false)
            {
                val1 = dfs1(i,j, M1[i][j]);                
                scc1[M1[i][j]] = max(scc1[M1[i][j]],val1);
            }
        }
    }

    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(F2[i][j] == false)
            {
                val2 = dfs2(i,j, M2[i][j]);                
                scc2[M2[i][j]] = max(scc2[M2[i][j]],val2);
            }
        }
    }

    int s1=0, s2 =0;

    for(int i=0;i<26;i++)
    {
        s1= s1+(scc1[i]*(scc1[i]-1))/2;
        s2= s2+(scc2[i]*(scc2[i]-1))/2;
    }

    cout<<s1<<" "<<s2<<endl;
    return 0;
}