int @N;
	VVLL D(N, VLL(N, 0));
	rd(D(N)(N));
	ll f[1 << N][N];
	rep(i, 1 << N) rep(j, N) f[i][j] = ll_inf;
	rep(i, N) f[1 << i][i] = 0;
	rep(bit, 1, 1 << N) {
		rep(i, N) if(bit & (1 << i)) rep(j, N) if(bit & (1 << j)) {
			if(i == j) continue;
			f[bit][i] = min(f[bit][i], f[bit ^ (1 << i)][j] + __builtin_popcount(bit ^ (1 << i)) * D[i][j]);
		}
	}
	wt(f[(1 << N) - 1][0]);