#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cout << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a >= b) { a = b; return 1; } return 0; }
#define int long long

using edge = pair<int, pair<int, int>>;

struct UnionFind {
    vector<int> par, w;
    
    UnionFind(int n) : par(n, -1), w(n, 0) { }
    void init(int n) { par.assign(n, -1); w.assign(n, 0); }
    
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            ++w[x];
            return false;
        }
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        w[x] += w[y];
        ++w[x];
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
 
    int wei(int x) {
        return w[root(x)];
    }
};

void solve() {
	int n; cin >> n;
    int d[330][330], e[330][330];
    bool ok[330][330];
    rep(i, n) {
        rep(j, n) {
            cin >> d[i][j];
            e[i][j] = d[i][j];
            ok[i][j] = true;
        }
    }
    rep(k, n) {
        rep(i, n) {
            rep(j, n) {
                if(chmin(e[i][j], e[i][k] + e[k][j])) {
                    if(i != k && j != k) ok[i][j] = false;
                }
            }
        }
    }
    vector<edge> es;
    int res = 0;
    rep(i, n) {
        rep(j, n) {
            if(e[i][j] != d[i][j]) {
                cout << -1 << endl;
                return;
            }
            //es.push_back(make_pair(d[i][j], make_pair(i, j)));
            if(i < j) {
                if(ok[i][j]) res += d[i][j];
            }
        }
    }
    // sort(all(es));
    // UnionFind uf(n);
    // int res = 0;
    // for(auto& eg: es) {
    //     int c = eg.fr, f = eg.sc.fr, t = eg.sc.sc;
    //     if(!uf.issame(f, t)) {
    //         uf.merge(f, t);
    //         res += c;
    //     }
    // }
    cout << res << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
    return 0;
}

Measured memory_bytes: 1920