#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int N,T[30][30];

bool check(){
    for(int a = 0;a < N;++a){
        for(int b = 0;b < N;++b){
            for(int c = 0;c < N;++c){
                int ret1 = T[ T[a][b] ][c];
                int ret2 = T[a][ T[b][c] ];
                if(ret1 != ret2) return false;
            }
        }
    }
    bool found = false;
    for(int e = 0;e < N;++e){
        found = true;
        for(int i = 0;i < N;++i){
            if(T[i][e] != i || T[e][i] != i){
                found = false;
            }
        }
        if(!found) continue;
        for(int i = 0;i < N;++i){
            found = false;
            for(int j = 0;j < N;++j){
                if(T[i][j] == e && T[j][i] == e){
                    found = true;
                }
            }
            if(!found) break;
        }
        if(found){
            return true;
        }
    }
    return false;
}

int main(){
    cin >> N;
    for(int i = 0;i < N;++i){
        for(int j = 0;j < N;++j){
            cin >> T[i][j];
        }
    }
    cout << (check()? "Yes" : "No") << endl;
    return 0;
}