#include <bits/stdc++.h>

using namespace std;
int le[30],nu[30],ml[30][30],mn[30][30],n;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int dfs(int x, int y){
    int color = ml[x][y];
    ml[x][y]=-1;
    int c = 1;
    queue<pair<int, int> > qn;
    qn.push(make_pair(x,y));
    while(!qn.empty()){
        int nx = qn.front().first, ny = qn.front().second;
        qn.pop();
        //cout<<nx<<' '<<ny<<endl;
        for(int i=0;i<4;i++){
            if(nx+dx[i] >=0 and nx+dx[i]<n and ny+dy[i]>=0 and ny+dy[i]<n){
                if(ml[nx+dx[i]][ny+dy[i]]==color){
                    c++;
                    qn.push(make_pair(nx+dx[i],ny+dy[i]));
                    ml[nx+dx[i]][ny+dy[i]]=-1;
                }
            }
        }
    }
    return c;
}
int dfs1(int x, int y){
    int color = mn[x][y];
    mn[x][y]=-1;
    int c = 1;
    queue<pair<int, int> > qn;
    qn.push(make_pair(x,y));
    while(!qn.empty()){
        int nx = qn.front().first, ny = qn.front().second;
        qn.pop();
        //cout<<nx<<' '<<ny<<endl;
        for(int i=0;i<4;i++){
            if(nx+dx[i] >=0 and nx+dx[i]<n and ny+dy[i]>=0 and ny+dy[i]<n){
                if(mn[nx+dx[i]][ny+dy[i]]==color){
                    c++;
                    qn.push(make_pair(nx+dx[i],ny+dy[i]));
                    mn[nx+dx[i]][ny+dy[i]]=-1;
                }
            }
        }
    }
    return c;
}
int main(){
    int a,p=0,p1=0;
    char x;
    cin>>n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cin>>x>>a;
            mn[i][j]=a;
            ml[i][j]=((int)x)-65;
        }
    }
    memset(le,0,sizeof(le));
    memset(nu,0,sizeof(nu));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(ml[i][j]!=-1){
                int k = ml[i][j];
                int c = dfs(i,j);
                le[k] = max(le[k],c);
                //cout<<k<<' '<<le[k]<<endl;
            }
        }
    }
    for(int i=0;i<30;i++){
        p=p+((le[i]*(le[i]-1))/2);
    }
    cout<<p<<' ';
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(mn[i][j]!=-1){
                int k = mn[i][j];
                int c = dfs1(i,j);
                nu[k] = max(nu[k],c);
                //cout<<k<<' '<<nu[k]<<endl;
            }
        }
    }
    for(int i=0;i<30;i++){
        p1=p1+((nu[i]*(nu[i]-1))/2);
    }
    cout<<p1<<endl;
}