//Code by Lightningfall
//Start coding on ????/??/??
//Finish debugging on ????/??/??
#include<bits/stdc++.h>
using namespace std;
char s[2005][2005];
bitset<2005>bs[2005],yj[2005];
vector<int>pc[2005];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;++i){
        scanf("%s",s[i]+1);
        for(int j=1;j<=n;++j)if(s[i][j]=='1')bs[i].set(j);
    }
    for(int i=1;i<=n;++i)pc[i].emplace_back(i),yj[i].set(i);
    int sc=n;
    long long ans=0;
    for(int k=1;k<=n;++k){
        int cs=0;
        for(int i=1;i<=n;++i){
            bitset<2005>tt=yj[i];
            for(auto cu:pc[i])yj[i]|=bs[cu];
            tt^=yj[i];
            pc[i].clear();
            for(int j=tt._Find_first();j<=n;j=tt._Find_next(j)){
                pc[i].emplace_back(j),++cs;
            }
        }
        cs+=sc;
        if(k==n)cs=n*n;
        ans+=1ll*(cs-sc)*k*k;
        sc=cs;
    }
    printf("%lld\n",ans);
    return 0;
}