#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<vector<int> > g(n, vector<int>(n));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> g[i][j];
        }
    }

    vector<bool> v(n);
    vector<int> p;

    auto dfs = [&](auto &&dfs, int u) -> void {
        v[u] = true;
        p.push_back(u);
        for(int i = 0; i < n; i++){
            if (g[u][i] > 0 and !v[i]){
                dfs(dfs, i);
            }
        }
    };

    vector<bool> vis(n);
    vector<pair<int, int> > seg(n);

    auto inter = [&](pair<int, int> a, pair<int, int> b){
        int l = max(a.first, b.first);
        int r = min(a.second, b.second);
        return max(0, r - l);
    };

    const int N = 1e6;

    auto solve = [&](vector<int> p){
        // 枚举最左的区间
        for(auto x : p){
            for(auto u : p) vis[u] = false;
            bool ok = true;
            seg[x] = {0, N};
            vis[x] = true;
            using P = pair<int, int>;
            priority_queue<P, vector<P>, greater<P> > q;
            q.push({0, x});
            vis[x] = true;
            while(!q.empty() and ok){
                auto [_, t] = q.top();
                q.pop();
                for(auto j : p){
                    if (g[t][j] == 0) continue;
                    if (!vis[j]){
                        vis[j] = true;
                        int l = seg[t].second - g[t][j];
                        seg[j] = {l, l + N};
                        q.push({l, j});
                    }
                    else if (inter(seg[t], seg[j]) != g[t][j]){
                        ok = false;
                        break;
                    }
                }
            }
            if (ok) return;
        }
        cout << "No" << '\n';
        exit(0);
    };

    for(int i = 0; i < n; i++){
        if (v[i]) continue;
        p.clear();
        dfs(dfs, i);
        solve(p);
    }
    cout << "Yes" << '\n';

}