#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> Pr;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
// #define mid ((l+r)>>1)
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
ll n,w[15][15]; double p[15];

void adjust(ll x,ll y){
	double sum = p[x] + p[y];
	double F = 0, S = 0;
	for(ll i=1;i<=n;i++){
		if(i==x || i==y) continue;
		F += p[i]*w[i][x] - p[i]*w[i][y];
	}
	F += w[x][y]*sum;
	S -= w[x][y];
	if(w[x][y]){
		p[x] = - F / (2.0 * S);
		if(p[x] < 0) p[x] = 0;
		if(p[x] > sum) p[x] = sum;
		p[y] = sum - p[x];
	}
	else {
		if(F < 0) p[x] = 0, p[y] = sum;
		else if(F > 0) p[x] = sum, p[y] = 0;
		else p[x] = sum / 2, p[y] = sum / 2;
	}
}
void procedure(){
	n=read();
	for(ll i=1;i<=n;i++){
		for(ll j=1;j<=n;j++) w[i][j]=read();
	}
	for(ll i=1;i<=n;i++) p[i]=1.0/n;

	ll T = 50000;
	while(T--){
		for(ll i=1;i<=n;i++){
			for(ll j=i+1;j<=n;j++) adjust(i, j);
		}
	}

	double ans = 0;
	for(ll i=1;i<=n;i++){
		for(ll j=i+1;j<=n;j++)
			ans += p[i] * p[j] * w[i][j];
	}
	printf("%.10lf\n", ans);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}