#include<bits/stdc++.h>
#include<atcoder/modint>
#define int long long
using namespace std;
using mint=atcoder::modint998244353;
int inf=1e18;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	int n;cin>>n;
	vector<vector<int>>d(n,vector<int>(n));
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)cin>>d[i][j];
	bool ok=true,ok2=true;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			for(int k=0;k<n;k++){
				if(i==j&&d[i][j]!=0)ok=false;
				if(d[i][j]!=d[j][i])ok=false;
				if(d[i][j]>d[i][k]+d[k][j])ok=false;
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			for(int k=0;k<n;k++){
				if(i==j&&d[i][j]!=0)ok2=false;
				if(d[i][j]!=d[j][i])ok2=false;
				if(d[i][j]>max(d[i][k],d[k][j]))ok2=false;
			}
		}
	}
	if(ok)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	if(ok2)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}