// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n;
    cin >> n;
    vvi a(n, vi(n));
    unordered_set<int> st;
    rep(i, n) rep(j, n) {
        cin >> a[i][j];
        st.insert(a[i][j]);
    }

    bool flag = true;

    rep(i, n) rep(j, n) rep(k, n) {
        if(a[a[i][j]][k] != a[i][a[j][k]]) flag = false;
    }
    bool f2 = false;
    rep(e, n) {
        bool f = true;
        rep(i, n) if(a[i][e] != i || a[e][i] != i) f = false;
        rep(i, n) {
            bool g = false;
            rep(j, n) if(a[i][j] == e && e == a[j][i]) g = true;
            if(!g) f = false;
        }
        if(f) f2 = true;
    }

    if(flag && f2) cout << "Yes" << endl;
    else cout << "No" << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}