#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
int main(){
  ll n;cin >> n;
  vvl v(n,vl(n));
  rep(i,n)rep(j,n)cin >> v[i][j];
  rep(i,n){
    rep(j,n){
      rep(k,n){
        ll f=v[k][v[j][i]];
        ll g=v[v[k][j]][i];
        if(f!=g){
          cout << "No" << endl;return 0;
        }
      }
    }
  }
  ll e=-1;
  rep(i,n){
    bool ok=true;
    rep(j,n)if(v[j][i]!=j)ok=false;
    if(ok)e=i;
  }
  if(e==-1){
    cout << "No" << endl;return 0;
  }
  rep(i,n){
    bool ok=false;
    rep(j,n){
      if(v[i][j]==e&&v[j][i]==e)ok=true;
    }
    if(!ok){
      cout << "No" << endl;return 0;
    }
  }
  cout << "Yes" << endl;
}