#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector d(n, vector<int>(n));
	rep(i, n)rep(j, n)cin >> d[i][j];
	vector<int>chk(4, true);
	rep(i, n)rep(j, n) {
		if (!d[i][j] && (i != j))chk[0] = false;
		if (d[i][j] && (i == j))chk[0] = false;
		if (d[i][j] != d[j][i])chk[1] = false;
	}
	rep(i, n)rep(j, n)rep(k, n) {
		if (d[i][j] > d[i][k] + d[k][j])chk[2] = false;
		if (d[i][j] > max(d[i][k], d[k][j]))chk[3] = false;
	}
	cout << (chk[0] + chk[1] + chk[2] == 3 ? "Yes" : "No") << endl;
	cout << (chk[0] + chk[1] + chk[3] == 3 ? "Yes" : "No") << endl;
	return 0;
}