#include<iostream>
using namespace std;

int main() {
	int n;
	cin >> n;
	double x[n], y[n];
	for (int i = 0;i < n;i++) {
		cin >> x[i] >> y[i];
	}
	int flag = 0;
	for (int i = 0;i < n - 2;i++) {
		for (int j = i + 1;j < n - 1;j++) {
			for (int k = j + 1;k < n;k++) {
				if (x[i] == x[j]) {
					if (x[i] == x[k]) {
						flag = 1;
						goto ans;
					}
				}
				else {
					double dx, dy, b;
					dx = x[i] - x[j];
					dy = y[i] - y[j];
					b = y[i] - dy * x[i] / dx;
					double right, left;
					left = y[k];
					right = dy * x[k] / dx + b;
					if (abs(left - right) < 0.00001) {
						flag = 1;
						goto ans;
					}
				}
			}
		}
	}
	goto ans;
ans:
	if (flag==1) cout << "Yes" << endl;
	else cout << "No" << endl;
}
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14 
/**#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops”)**/
#include <bits/stdc++.h>  
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 1000000007ll //998244353ll
#define lld long double
#define mii map<int, int>
#define pii pair<int, int>
#define ff first
#define ss second 
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; i++)    
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define print2d(dp,n,m) for(int i=0;i<=n;i++){for(int j=0;j<=m;j++)cout<<dp[i][j]<<" ";cout<<"\n";}
typedef std::numeric_limits< double > dbl;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
const long long N=200005, INF=2000000000000000000;
lld pi=3.1415926535897932;
int lcm(int a, int b)
{
    int g=__gcd(a, b);
    return a/g*b;
}
int power(int a, int b, int p)
    {
        if(a==0)
        return 0;
        int res=1;
        a%=p;
        while(b>0)
        {
            if(b&1)
            res=(res*a)%p;
            b>>=1;
            a=(a*a)%p;
        }
        return res;
    }

int32_t main()
{
    IOS;
    int n;
    cin>>n;
    int a[n][n];
    int r[n];
    rep(i,0,n)
    {
        r[i]=1e9;
        rep(j,0,n)
        {
            cin>>a[i][j];
            r[i]=min(r[i], a[i][j]);
        }
    }
    int c[n], f=0;
    rep(i,0,n)
    {
        c[i]=a[0][i]-r[0];
    }
    rep(i,0,n)
    {
        rep(j,0,n)
        {
            if(r[i]+c[j]!=a[i][j])
            {
                cout<<"No";
                return 0;
            }
        }
    }
    cout<<"Yes\n";
    rep(i,0,n)
    cout<<r[i]<<" ";cout<<"\n";
    rep(i,0,n)
    cout<<c[i]<<" ";
}