#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	int D[n][n];
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			cin >> D[i][j];
		}
	}
	int ans = 3;
	for(int i = 0; i < n; i++){
		if(D[i][i] != 0) ans = 0;
		for(int j = 0; j < n; j++){
			if(D[i][j] != D[j][i]) ans = 0;
			for(int k = 0; k < n; k++){
				if(D[i][j] > D[i][k] + D[k][j]) ans &= 2;
				if(D[i][j] > max(D[i][k], D[k][j])) ans &= 1;
			}
		}
	}
	cout << (ans & 1 ? "Yes" : "No") << '\n';
	cout << (ans & 2 ? "Yes" : "No") << '\n';
}