#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }

#define MOD 1000000007LL
#define INF (1LL<<60)

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N;
	while(cin>>N) {
		VVI w(N, VI(N));
		REP(i, N) REP(j, N) cin>>w[i][j];
//		REP(i, N) REP(j, N) w[i][j] = UNIFORM_LL(1, 100);
		VVI ww(w);
		REP(k, N) REP(i, N) REP(j, N) ww[i][j] = min(ww[i][j], ww[i][k]+ww[k][j]);
//		DD(ww);
//		w=ww;
		if(ww==w) {
			vector<pair<ll, pair<ll, ll>>> es;
			REP(i, N) REP(j, i) es.PB(MP(w[i][j], MP(i, j)));
			sort(ALL(es));
//			DD(es);
			ll ans = 0;
//			VVI ww(N, VI(N, INF));
//			REP(i, N) ww[i][i]=0;
			REP(ei, es.size()) {
				ll cost = es[ei].first, I = es[ei].second.first, J=es[ei].second.second;
				bool v = 1;
				REP(i, N) if(i!=I&&i!=J&&ww[I][J]==ww[I][i]+ww[i][J]) v=0;
				if(v) {
					ans += cost;
				}
//				if(cost < ww[I][J]) {
//					ans += cost;
//					VVI b(ww);
//					ww[I][J] = ww[J][I] = cost;
//					REP(k, N) REP(i, N) REP(j, N) if(k==I||k==J) ww[i][j] = min(ww[i][j], ww[i][k]+ww[k][j]);
//
////					REP(i, N) ww[I][i] = min(ww[I][i], ww[I][J]+ww[J][i]);
////					REP(i, N) ww[i][I] = min(ww[i][I], ww[i][J]+ww[J][I]);
////					REP(i, N) ww[J][i] = min(ww[J][i], ww[J][I]+ww[I][i]);
////					REP(i, N) ww[i][J] = min(ww[i][J], ww[i][I]+ww[I][J]);
//
//					DD("put");
//					DD(cost);DD(I);DD(J);
//					DD(ww);
//					REP(i, N) REP(j, N) if(b[i][j]!=ww[i][j]) {
//						cout<<"DIFF "<<i<<" "<<j<<" "<<b[i][j]<<" -> "<<ww[i][j]<<endl;
//					}
//				}
			}
			cout<<ans<<endl;
		} else {
			cout<<-1<<endl;
		}
//		break;
	}
	
	return 0;
}


Measured memory_bytes: 3320