#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<queue>
#include<set>
#include<bitset>
#define rep(i,a,n) for(int i = a;i <= n;i++)
#define per(i,n,a) for(int i = n;i >= a;i--)
#define enter putchar('\n')using namespace std;
typedef long long ll;
const int M = 2005;
const int N = 1000005;
const double eps = 1e-6;
const double fi = 0.61803399;
const double fim = 0.38196601;int read()
{int ans = 0,op = 1;char ch = getchar();while(ch < '0' || ch > '9'){if(ch == '-') op = -1;ch = getchar();}while(ch >= '0' && ch <= '9'){ans *= 10;ans += ch - '0';ch = getchar();}return ans * op;
}struct edge
{int next,to,from;
}e[N<<2],e1[N<<2];
int n,g[M][M],dfn[M],low[M],stack[M],top,idx,cur,ecnt,head[M],sd[M],h[M],sz[M],ecnt1,q[M],curr,tot;
char s[M];
ll ans;
bool vis[M],pd[M];void add(int x,int y)
{e[++ecnt].to = y;e[ecnt].from = x;e[ecnt].next = head[x];head[x] = ecnt;
}void tarjan(int x)
{low[x] = dfn[x] = ++idx;vis[x] = 1,stack[++top] = x;for(int i = head[x];i;i = e[i].next){if(!dfn[e[i].to]) tarjan(e[i].to),low[x] = min(low[x],low[e[i].to]);else if(vis[e[i].to]) low[x] = min(low[x],low[e[i].to]);}if(low[x] == dfn[x]){int p;cur++;while(p = stack[top--]){sd[p] = cur,vis[x] = 0,sz[cur]++;if(x == p) break;}}
}void dfs(int x)
{
tot += sz[x],pd[x] = 1,q[++curr] = x;for(int i = h[x];i;i = e1[i].next){if(pd[e1[i].to]) continue;dfs(e1[i].to);}
}int main()
{n = read();rep(i,1,n){scanf("%s",s);rep(j,0,n-1) if(s[j] == '1') add(i,j+1);}rep(i,1,n) if(!dfn[i]) tarjan(i);rep(i,1,ecnt){int r1 = sd[e[i].from],r2 = sd[e[i].to];if(r1 != r2){e1[++ecnt1].to = r2;e1[ecnt1].next = h[r1];e1[ecnt1].from = r1;h[r1] = ecnt1;}}rep(i,1,cur){rep(i,1,curr) q[i] = 0;tot = 0;dfs(i);rep(i,1,curr) pd[q[i]] = 0;ans += tot * sz[i];}printf("%lld\n",ans);return 0;
}

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<queue>
#include<set>
#include<bitset>
#define rep(i,a,n) for(int i = a;i <= n;i++)
#define per(i,n,a) for(int i = n;i >= a;i--)
#define enter putchar('\n')using namespace std;
typedef long long ll;
const int M = 5005;
const double eps = 1e-6;
const double fi = 0.61803399;
const double fim = 0.38196601;int read()
{int ans = 0,op = 1;char ch = getchar();while(ch < '0' || ch > '9'){if(ch == '-') op = -1;ch = getchar();}while(ch >= '0' && ch <= '9'){ans *= 10;ans += ch - '0';ch = getchar();}return ans * op;
}bitset <2005> f[M];
int n;
char s[M];
ll ans;int main()
{n = read();rep(i,1,n){scanf("%s",s);rep(j,0,n-1) if(s[j] == '1') f[i][j+1] = 1;f[i][i] = 1;}rep(i,1,n)rep(j,1,n) if(f[j][i]) f[j] |= f[i];rep(i,1,n) ans += f[i].count();printf("%lld\n",ans);return 0;
}