#include <bits/stdc++.h>

using namespace std;

#define fore(i, a, b) for(ll i = a, bella = b; i < bella; i++)
#define mset(a, b) memset(a, b, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define SZ(a) ll(a.size())
#define fst first
#define snd second
#define pb push_back
#define FIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)

typedef double ld;
typedef int ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

const ll MAXN = 15;
ll w[MAXN][MAXN], n;
ld v[MAXN];

ld calc() {
    ld ret = 0;
    fore(i, 0, n) fore(j, i + 1, n) ret += v[i] * v[j] * ld(w[i][j]);
    return ret;
}

void upd(ll a, ll b) {
    ld sum = v[a] + v[b];
    ld s = 0, e = v[a] + v[b];
    ll it = 100;
    while(it--) {
        ld m0 = (s * 2.0 + e) / 3.0, m1 = (s + e * 2.0) / 3.0;
        
        ld a0 = m0, b0 = v[a] + v[b] - a0;
        ld a1 = m1, b1 = v[a] + v[b] - a1;

        v[a] = a0, v[b] = b0;
        ld c0 = calc();

        v[a] = a1, v[b] = b1;
        ld c1 = calc();

        if(c0 < c1) {
            s = m0;
            v[a] = s, v[b] = sum - v[a];
        } else {
            e = m1;
            v[a] = e, v[b] = sum - v[a];
        }
    }
}

int main() { FIO;

    cin >> n;
    fore(i, 0, n) fore(j, 0, n) cin >> w[i][j];

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    uniform_int_distribution<int> distr(0, n-1);
    auto cl=clock();
    while(ld(clock() - cl)/CLOCKS_PER_SEC < 0.98) {
        fore(i, 0, n) v[i] = 1.0/ld(n);

        ll it = 1000;
        while(it--) {
            ll a = distr(rng), b;
            while(a == b) b = distr(rng);

            upd(a, b);
        }
    }
    
    cout << fixed << setprecision(12) << calc() << '\n';

    return 0;
}