FUNKVAL

#include <bits/stdc++.h>
#define check(N, A, B) assert((int)(N) >= (int)(A) && (int)(N) <= (int)(B))
using namespace std;
const int maxn = 30;
typedef long long ll;
int a[maxn][maxn];
int floor(int x){
    int l = 0, r = x;
    while(l < r){
        int m = l+(r-l)/2;
        if(m*m <= x) l = m+1;
        else r = m;
    }
    if(l*l > x) l--;
    return l;
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k; cin >> n;
    check(n,1,28);
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++){
            cin >> a[i][j];
            check(a[i][j],0,1e6);
        }

    for(int i=0;i<n;i++){
        assert(a[i][i] == 0);
        for(int j=0;j<n;j++)
            assert(a[i][j] == a[j][i]);
    }

    ll cur = 0, ans = 0;
    for(int i=0;i<(1<<n);i++){
        int msk = i^(i/2);
        if(i == 0){
            for(int j=0;j<n;j++)
                if(msk&(1<<j)) for(int k=0;k<j;k++)
                    if(msk&(1<<k)) cur += a[j][k];
            // cout << msk << ": " << cur << endl;
        } else {
            int prv = (i-1)^((i-1)/2);
            int del = __builtin_ctz(prv^(msk));
            int sgn = (msk&(1<<del))?1:-1;
            for(int j=0;j<n;j++)
                if(j != del && (msk&(1<<j))){
                    cur += sgn*a[j][del];
                    // cout << "-> " << del << " " << j << " " << a[j][del] << endl;
                }
            // cout << msk << ": " << del << " " << sgn << " " << cur << endl;
        }
        ans += cur * floor(__builtin_popcount(msk));
    }
    cout << ans << "\n";
}