/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *                               ????            ??BUG
 */

/*
 * @Description: I want to be the weakest vegetable in the world!
 * @Author: I.Z.
*/
#include<bits/stdc++.h>
using namespace std;
#define MOD         998244353
#define speMOD      2933256077ll
#define pii         pair<int,int>
#define all(v)      v.begin(),v.end()
#define pb          push_back
#define REP(i,b,e)  for(int i=(b);i<(int)(e);++i)
#define over(x)     {cout<<(x)<<endl;return;}
#define lowbit(x)   ((x)&(-(x)))
#define cntbit(x)   __builtin_popcount(x)
#define deal(v)     sort(all(v));v.erase(unique(v.begin(),v.end()),v.end())
#define lbound(v,x) lower_bound(all(v),x)-v.begin()
mt19937 sd(random_device{}());
int qpow(int a,int b,int m=MOD,int res=1){
	a%=m;
	while(b>0)res=(b&1)?(res*a%m):(res),a=a*a%m,b>>=1;
	return res;
}
int exgcd(int x,int y,int &a,int &b){
	if(y==0){
		a=1;b=0;
		return x;
	}
	int d=exgcd(y,x%y,a,b);
	int z=b;
	b=a-b*(x/y);
	a=z;
	return d;
}
int _x_,_y_;
inline int inverse(int x,int y=MOD){
	exgcd(x,y,_x_,_y_);
	return (_x_+y)%y;
}
int fac[2000005],inv[2000005];
void init(int n){
	fac[0]=inv[0]=1;
	REP(i,1,n+1)fac[i]=fac[i-1]*i%MOD;
	inv[n]=qpow(fac[n],MOD-2);
	for(int i=n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%MOD;
}
int binom(int x,int y){
	return x<y||y<0? 0:fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
int n;
int a[200][200];
int s1[200],s2[200];
vector<int>v[200],v2[200];
int f[270000],g[270000][18][18][2];
void chmn(int &x,int y){if(x>y)x=y;}
void Main() {
	cin>>n;
	int ans=0;
	REP(i,0,n){
		REP(j,0,n)cin>>a[i][j];
		REP(j,0,n){
			if(a[i][j]!=-1)v[i].pb(j),v2[j].pb(i);
		}
		REP(j,0,i)if(a[i][j]!=-1){
			int x=min(a[i][j],a[j][i]);
			a[i][j]-=x;a[j][i]-=x;
			ans+=x;
		}
	}
	f[0]=0;
	REP(i,1,(1<<n))f[i]=1e9;
	REP(i,0,(1<<n)){
		REP(j,0,n){
			REP(l,0,n){
				REP(p,0,2)g[i][j][l][p]=1e9;
			}
		}
	}
	REP(i,0,(1<<n)){
		if(cntbit(i)==1)f[i]=0;
		REP(j,0,n)if((i>>j)&1){
			for(auto l:v2[j])if(((i>>l)&1))f[i]=min(f[i],g[i][l][j][1]+a[l][j]);//,cout<<j<<' '<<l<<' '<<g[i][l][j][1]+a[l][j]<<endl;
		}
		if(f[i]!=1e9){
			REP(j,0,n)if((i>>j)&1){
				REP(l,0,n)if(((i>>l)&1)){
					for(auto t:v[j])if(!((i>>t)&1)){
						chmn(g[i|(1<<t)][t][l][0],f[i]+a[j][t]);
					}
				}
			}
		}
		REP(j,0,n)if((i>>j)&1){
			REP(l,0,n)if((i>>l)&1){
				int r=min(g[i][j][l][1],g[i][j][l][0]);
				if(r!=1e9){
					for(auto p:v[j])if(!((i>>p)&1)){
						chmn(g[i|(1<<p)][p][l][1],r+a[j][p]);
					}
				}
			}
		}
//		REP(j,0,n)cout<<((i>>j)&1);
//		cout<<": "<<f[i]<<' '<<g[61][2][0][1]<<endl;
	}
//	cout<<ans<<endl;
	if(f[(1<<n)-1]==1e9)over(-1)
	cout<<f[(1<<n)-1]+ans<<endl;
}
void TC() {
    int tc=1;
	while(tc--){
		Main();
		cout.flush();
	}
}
signed main() {
	return cin.tie(0),cout.tie(0),ios::sync_with_stdio(0),TC(),0;
}
/*
1. CLEAR the arrays (ESPECIALLY multitests)
2. DELETE useless output
 */