#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    template<class U> modular(const U& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular exp(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int N, m;
ll ans;

int meet[1500][1500], lo[1500][1500], hi[1500][1500], bot[1500][1500];
int cum[1500], ri[1500][1500], le[1500][1500], tot[1500][1500];
// ri: row <= r, right < b
// le: row <= r, left > a 
// tot: a < left <= right < b

vector<string> transpose(vector<string> A) {
    vector<string> a(sz(A[0]));
    F0R(i,sz(A)) F0R(j,sz(A[0])) a[j] += A[i][j];
    return a;
}

int meetPoint(int a, int b) {
    int x = meet[a][b]; if (x > min(bot[m+1][a],bot[m+1][b])) return MOD;
    return x;
}

int bothReach(int a, int b, int r) {
    if (meetPoint(a,b) > min(r,MOD-1)) return 0;
    ckmin(r,min(bot[m+1][a],bot[m+1][b]));
    // ps("HUH",r,cum[r],ri[r][b],le[r][a],tot[a][b]);
    return cum[r]-ri[r][b]-le[r][a]+tot[a][b];
}

int reach(int a) { return bothReach(a,a,MOD); }

void initLo(const vector<string>& A) {
    FOR(i,m+1,sz(A)) F0R(j,sz(A[0])) {
        lo[i][j] = MOD, hi[i][j] = -MOD;
        if (A[i][j] == '#') continue;
        if (i == m+1) lo[i][j] = hi[i][j] = j;
        if (i > m+1) ckmin(lo[i][j],lo[i-1][j]), ckmax(hi[i][j],hi[i-1][j]);
        if (j) ckmin(lo[i][j],lo[i][j-1]), ckmax(hi[i][j],hi[i][j-1]);
    }
    FORd(i,m+1,sz(A)) F0Rd(j,sz(A[0])) {
        bot[i][j] = -MOD; if (A[i][j] == '#') continue;
        bot[i][j] = i;
        if (j+1 < sz(A[0])) ckmax(bot[i][j],bot[i][j+1]);
        if (i+1 < sz(A)) ckmax(bot[i][j],bot[i+1][j]);
        // ps(i,j,bot[i][j]);
    }
    // exit(0);
    F0R(i,sz(A[0])) FOR(j,i,sz(A[0])) {
        meet[i][j] = MOD;
        tot[i][j] = 0;
    }
    FOR(i,m+1,sz(A)) F0R(j,sz(A[0])) if (lo[i][j] != MOD) {
        ckmin(meet[lo[i][j]][hi[i][j]],i);
        if (lo[i][j] > 0 && hi[i][j]+1 < sz(A[0])) tot[lo[i][j]-1][hi[i][j]+1] += A[i][j]-'0';
    }
    F0R(i,sz(A[0])) FORd(j,i+1,sz(A[0])) {
        ckmin(meet[i+1][j],meet[i][j]); ckmin(meet[i][j-1],meet[i][j]);
    }
    F0Rd(i,sz(A[0])) FOR(j,i+1,sz(A[0])) {
        tot[i][j] += tot[i+1][j]+tot[i][j-1];
        if (i+2 <= j) tot[i][j] -= tot[i+1][j-1];
    }
    // ps(meet[0][0],meet[0][1],meet[1][1]);
    cum[m] = 0; F0R(j,sz(A[0])) ri[m][j] = le[m][j] = 0;
    FOR(i,m+1,sz(A)) {
        cum[i] = cum[i-1];
        F0R(j,sz(A[0])) ri[i][j] = le[i][j] = 0;
        F0R(j,sz(A[0])) if (lo[i][j] != MOD) {
            cum[i] += A[i][j]-'0';
            if (hi[i][j]+1 < sz(A[0])) ri[i][hi[i][j]+1] += A[i][j]-'0';
            if (lo[i][j]-1 >= 0) le[i][lo[i][j]-1] += A[i][j]-'0';
        }
        FOR(j,1,sz(A[0])) ri[i][j] += ri[i][j-1];
        F0Rd(j,sz(A[0])-1) le[i][j] += le[i][j+1];
        // ps("WUT",i,ri[i][3], le[i][0]);
        F0R(j,sz(A[0])) {
            ri[i][j] += ri[i-1][j];
            le[i][j] += le[i-1][j];
        }
    }
    /*ps(reach(0), reach(1), bothReach(0,1,1), bothReach(0,1,2), bothReach(0,1,0));
    exit(0);*/
    /*FOR(i,m+1,sz(A)) F0R(j,sz(A[0])) {
        ps(i,j,bot[i][j],lo[i][j],hi[i][j]);
    }*/
    //ps(bothReach(0,0,MOD)); exit(0);
    //ps(reach(0),reach(2),reach(3),bot[2][0],bot[2][2],bot[2][3]); exit(0);
    //ps(bothReach(0,2,3),bothReach(0,2,2),bothReach(0,3,3), bothReach(2,3,2)); exit(0);
}

int MN[1500][1500], MX[1500][1500], HI[1500][1500];

void initHi(const vector<string>& A) {
    F0Rd(i,m+1) F0Rd(j,sz(A[0])) {
        MN[i][j] = MOD, MX[i][j] = -MOD;
        if (A[i][j] == '#') continue;
        if (i == m) MN[i][j] = MX[i][j] = j;
        if (i+1 <= m) ckmin(MN[i][j],MN[i+1][j]), ckmax(MX[i][j],MX[i+1][j]);
        if (j+1 < sz(A[0])) ckmin(MN[i][j],MN[i][j+1]), ckmax(MX[i][j],MX[i][j+1]);
    }
    // ps(MN[0][0],MX[0][0],MN[0][1],MX[0][1]); exit(0);
    F0R(i,m+1) F0R(j,sz(A[0])) {
        HI[i][j] = MOD; if (A[i][j] == '#') continue;
        HI[i][j] = i;
        if (i) ckmin(HI[i][j],HI[i-1][j]);
        if (j) ckmin(HI[i][j],HI[i][j-1]);
    }
    // ps(HI[0][0],HI[0][1]);
}

ll cur;
deque<array<int,3>> yes; // pos, low point, cans
int dumb[1500];
vi ins;

vector<string> _A;

void ad(int x) {
    if (lo[m+1][x] == MOD) return;
    ins.pb(x);
    array<int,3> tmp = {x,bot[m+1][x],reach(x)}; cur += tmp[2];
    int lst = 0;
    while (sz(yes)) {
        int t = bothReach(yes.back()[0],tmp[0],MOD)-bothReach(yes.back()[0],tmp[0],lst);
        /*if (sz(_A) == 9) {
            ps("HUH",yes.back()[0],tmp[0],lst,bothReach(yes.back()[0],tmp[0],MOD),bothReach(yes.back()[0],tmp[0],lst));
        }*/
        cur -= t; yes.back()[2] -= t; lst = yes.back()[1];
        if (yes.back()[1] <= tmp[1]) {
            assert(yes.back()[2] >= 0);
            dumb[yes.back()[0]] = yes.back()[2], yes.pop_back();
        } else break;
    }
    yes.pb(tmp);
    // if (sz(_A) == 9) ps("HA",tmp);
}

void del(int x) {
    if (lo[m+1][x] == MOD) return;
    if (sz(yes) && yes.front()[0] == x) {
        assert(dumb[x] == -1);
        cur -= yes.front()[2]; yes.pop_front();
        return;
    } else {
        if (dumb[x] == -1) {
            ps("HA",x,ins);
            trav(t,yes) ps(t);
            exit(0);
        }
        cur -= dumb[x];
    }
}

void solve(vector<string> A) {
    if (sz(A) < sz(A[0])) A = transpose(A);
    if (sz(A) == 1) return;
    _A = A;
    m = (sz(A)-1)/2;
    initLo(A); initHi(A);
    F0R(i,m+1) {
        int l = 0, r = -1; cur = 0;
        while (sz(yes)) yes.pop_back();
        ins.clear();
        // ps("DOING",i);
        F0R(j,sz(A[0])) dumb[j] = -1;
        F0R(j,sz(A[0])) if (MX[i][j] != -MOD) {
            while (r < MX[i][j]) {
                r ++; 
                if (HI[m][r] <= i) ad(r);
            }
            while (l < MN[i][j]) {
                if (HI[m][l] <= i) del(l);
                l ++;
            }
            ans += (A[i][j]-'0')*cur;
        }
    }
    auto x = vector<string>(A.begin(),A.begin()+m+1);
    auto y = vector<string>(A.begin()+m+1,A.end());
    solve(x); solve(y);
}

int main() {
    setIO(); re(N);
    vector<string> A(N); re(A);
    solve(A); ps(ans);
}


/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Measured memory_bytes: 89924