#include<bits/stdc++.h>
#define its(x,y) (max(0,L-abs(x-y)))
using namespace std;
const int N = 1005,L = 1e6;
inline int read(){
	int s = 0;char ch = getchar();
	while(!isdigit(ch))ch = getchar();
	while(isdigit(ch)){s = (s<<1)+(s<<3)+ch-'0';ch = getchar();}
	return s;
}
int vis[N],tot,e[N][N],pos[N],n,fa[N];
void dfs(int p){
	vis[p] = tot;
	for(int v = 1;v<=n;v++){
		if(vis[v]||!e[p][v])continue;
		fa[v] = p;
		pos[v] = pos[p]+L-e[p][v];
		if(its(pos[v],pos[fa[p]])!=e[fa[p]][v]){
			pos[v] = (pos[p]<<1)-pos[v];
		}
		if(its(pos[v],pos[fa[p]])!=e[fa[p]][v]){
			printf("No\n");
			exit(0);
		}
		dfs(v);
	}
}
int main(){
	n = read();
	for(int i = 1;i<=n;i++)
		for(int j = 1;j<=n;j++)e[i][j] = read();
	for(int i = 1,v;i<=n;i++){
		if(!vis[i]){
			v = 0;
			for(int j = i+1;j<=n;j++)if(e[i][j])v = j;
			if(!v)continue;
			pos[v] = L-e[i][v];
			fa[v] = i;fa[i] = v;
			vis[v] = vis[i] = ++tot;
			dfs(i);dfs(v);
		}
	}
	for(int i = 1;i<n;i++){
		for(int j = i+1;j<=n;j++){
			if(vis[i]==vis[j]&&its(pos[i],pos[j])!=e[i][j]){
				printf("No\n");
				return 0;
			}
		} 
	}
	printf("Yes\n");
	return 0;
}