#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int maxn = ;

 int n,m,s,cnt;

 struct edge{

     int from,to,w;

     bool operator < (const edge &b) const{

         return w < b.w;

     }

 }e[maxn*maxn];

 struct node{

     int u,v,w;

     bool operator < (const node &b) const{

         return w<b.w;

     }

 };

 struct Node{

     vector<int> v;

     vector<int> w;

 }g[maxn];

 int fa[maxn],dis[maxn][maxn];

 vector<node> ans;

 int get(int x){

     if(x == fa[x]) return x;

     return fa[x] = get(fa[x]);

 }

 void merge(int x,int y){

     int u = get(x),v = get(y);

     if(u == v) return;

     fa[u] = v;

 }

 void kruskal(){

     sort(e+,e++m);

     for(int i = ;i<=n;i++) fa[i] = i;

     for(int i = ;i<=m;i++){

         int x = get(e[i].from );

         int y = get(e[i].to );

         if(x == y) continue;

         merge(x,y);

         ans.push_back({e[i].from,e[i].to,e[i].w});

     }

 }

 void addedge(int x,int y,int c){

     e[cnt].from = x,e[cnt].to = y,e[cnt].w = c;

     cnt++;

 }

 int vis[maxn],siz[maxn];

 void dfs(int cur,int pos){//只需求出一个点到各个点的最小距离即可进行判断

     vis[cur] = ;

     siz[cur] = pos;

     for(int i = ;i<g[cur].v.size();i++){

         int v = g[cur].v[i];

         if(!vis[v]) dfs(v,pos+g[cur].w[i]);

     }

 }

 int main(){

     cin>>n;

     m = n*(n-),cnt = ;;

     for(int i = ;i<=n;i++){

         for(int j = ;j<=n;j++){

             cin>>dis[i][j];

             if(i == j) continue;

             addedge(i,j,dis[i][j]);

         }

     }

     kruskal();

     for(int i = ;i<ans.size();i++){//建一个新图

         node t = ans[i];

         g[t.u].v.push_back(t.v);

         g[t.v].v.push_back(t.u);

         g[t.u].w.push_back(t.w);

         g[t.v].w.push_back(t.w);

     }

     for(int i = ;i<=n;i++){

         if(g[i].v.size() ==  ) {

             s = i;break;

         }

     }

     dfs(s,);

     for(int i = ;i<=n;i++){

         if(siz[i]!=dis[s][i]){

             cout<<"No";return ;

         }

     }

     sort(ans.begin(),ans.end());

     cout<<"Yes"<<endl;

     for(int i = ;i<ans.size();i++){

         cout<<ans[i].w<<endl;

     }

     return ;

 }