#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;

bool ketsugou(vector<vector<int>> a) {
    int n = a.size();
    bool ng = false;
    rep(i, n) rep(j, n) rep(k, n) {
        if(a[a[i][j]][k] != a[i][a[j][k]]) ng = true;
    }
    return !ng;
}

vector<int> tani(vector<vector<int>> a) {
    vector<int> v;
    int n = a.size();
    rep(e, n) {
        bool ng = false;
        rep(i, n) {
            if(a[i][e] != a[e][i] || a[e][i] != i) ng = true; 
        }
        if(!ng) v.pb(e);
    }
    return v;
}

bool gyaku(vector<vector<int>> a, vector<int> v) {
    int n = a.size();
    all(e, v) {
        bool ng = false;
        rep(i, n) {
            bool ok = false;
            rep(j, n) {
                if(a[i][j] == a[j][i] && a[j][i] == e) ok = true;
            }
            if(!ok) ng = true;
        }
        if(!ng) return true;
    }
    return false;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<vector<int>> a(n, vector<int> (n, 0));
    rep(i, n) rep(j, n) cin >> a[i][j];
    auto v = tani(a);
    cout << (ketsugou(a) && gyaku(a, v) ? "Yes" : "No") << endl;
    return 0;
}