#include <stdio.h>

int main () {
  int n = 0;
  int n0n1[30][30] = {};
  
  int res = 0;
  
  int is_ok = 1;
  int e = -1;
  
  res = scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      res = scanf("%d", n0n1[i]+j);
    }
  }
  
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
        if (n0n1[n0n1[i][j]][k] != n0n1[i][n0n1[j][k]]) {
          is_ok = 0;
        }
      }
    }
  }
  
  for (int i = 0; i < n; i++) {
    int is_e = 1;
    for (int j = 0; j < n; j++) {
      if (n0n1[i][j] != j || n0n1[j][i] != j) {
        is_e = 0;
      }
    }
    if (is_e > 0) {
      e = i;
    }
  }
  
  for (int i = 0; i < n; i++) {
    int is_inv = 0;
    for (int j = 0; j < n; j++) {
      if (n0n1[i][j] == e && n0n1[j][i] == e) {
        is_inv = 1;
      }
    }
    is_ok *= is_inv;
  }
  
  if (is_ok <= 0 || e < 0) {
    printf("No\n");
  } else {
    printf("Yes\n");
  }
  
  return 0;
}