输出一行一个整数，表示该图的连通数。

//qscqesze

#include <cstdio>

#include <cmath>

#include <cstring>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <set>

#include <bitset>

#include <vector>

#include <sstream>

#include <queue>

#include <typeinfo>

#include <fstream>

#include <map>

#include <stack>

typedef long long ll;

using namespace std;

//freopen("D.in","r",stdin);

//freopen("D.out","w",stdout);

#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)

#define maxn 200051

#define mod 10007

#define eps 1e-9

int Num;

//const int inf=0x7fffffff;   //нчоч╢С

const int inf=0x3f3f3f3f;

inline ll read()

{

    ll x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

//**************************************************************************************

vector<int> Q[maxn];

char s[];

int dfn[],low[],_clock=;

int sta[],top;

bool in_sta[];

int changed[],scc,num[];

bitset<> have[];

void tarjan(int x)

{

    dfn[x]=low[x]=++_clock;

    sta[++top]=x;

    in_sta[x]=;

    for(int i=;i<Q[x].size();i++)

    {

        int v = Q[x][i];

        if(!dfn[v])

            tarjan(v),low[x]=min(low[x],low[v]);

        else if(in_sta[v])

            low[x]=min(low[x],dfn[v]);

    }

    if(dfn[x]==low[x])

    {

        int temp;

        ++scc;

        do{

            temp = sta[top--];

            in_sta[temp]=;

            changed[temp]=scc;

            ++num[scc];

        }while(temp!=x);

    }

}

int main()

{

    int n=read();

    for(int i=;i<=n;i++)

    {

        scanf("%s",s+);

        for(int j=;j<=n;j++)

        {

            if(s[j]=='')

            Q[i].push_back(j);

        }

    }

    for(int i=;i<=n;i++)

        if(!dfn[i])tarjan(i);

    for(int i=;i<=n;i++)

        have[changed[i]][i]=;

    int ans=;

    for(int i=;i<=scc;i++)

    {

        ans+=num[i]*num[i];

        bitset<>temp;

        for(int x = ;x<=n;x++)

        {

            if(changed[x]==i)

            {

                for(int j=;j<Q[x].size();j++)

                {

                    int v = Q[x][j];

                    if(changed[v]!=i)

                    temp|=have[changed[v]];

                }

            }

        }

        ans+=num[i]*temp.count();

        have[i]|=temp;

    }

    printf("%d\n",ans);

}