#include <bits/stdc++.h>

using i6 = long long;

constexpr int L = 1E6;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    std::vector I(n, std::vector<int>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            std::cin >> I[i][j];
        }
    }
    
    std::vector<int> vis(n);
    std::vector<int> a(n);
    for (int s = 0; s < n; s++) {
        if (vis[s]) {
            continue;
        }
        std::vector<int> q;
        q.push_back(s);
        vis[s] = 1;
        
        int u = -1, v = -1;
        for (int i = 0; i < q.size(); i++) {
            int x = q[i];
            for (int y = 0; y < n; y++) {
                if (I[x][y] > 0 && !vis[y]) {
                    vis[y] = 1;
                    q.push_back(y);
                    if (u == -1 || I[u][v] < I[x][y]) {
                        u = x, v = y;
                    }
                }
            }
        }
        if (u != -1) {
            vis[u] = vis[v] = 2;
            a[v] = a[u] + L - I[u][v];
            while (true) {
                int x = -1;
                for (int i = 0; i < n; i++) {
                    if (vis[i] == 1 && (x == -1 || std::max(I[u][i], I[v][i]) > std::max(I[u][x], I[v][x]))) {
                        x = i;
                    }
                }
                if (x == -1) {
                    break;
                }
                vis[x] = 2;
                if (I[u][x] > I[v][x]) {
                    a[x] = a[u] - (L - I[u][x]);
                    u = x;
                } else {
                    a[x] = a[v] + (L - I[v][x]);
                    v = x;
                }
            }
        }
        for (auto i : q) {
            for (auto j : q) {
                if (I[i][j] != std::max(0, L - std::abs(a[i] - a[j]))) {
                    std::cout << "No\n";
                    return 0;
                }
            }
        }
    }
    
    std::cout << "Yes\n";
    
    return 0;
}