import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

public class Buvos {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        String sor;
        BufferedReader br = new BufferedReader(new FileReader(args[0]));

        while((sor = br.readLine())!=null){
            //feltoltes
            int n = Integer.parseInt(sor);
            int[][] m = new int[n][n];
            for (int i = 0; i < n; i++){
                String[] tmp = br.readLine().split(" ");
                for (int j = 0; j < n; j++){
                    m[i][j] = Integer.parseInt(tmp[j]);
                }
            }
            //mindenszamvizsgalat
            boolean buvos = true;
            boolean[] volt = new boolean[n*n+1];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    volt[m[i][j]] = true;
                }
            }
            for (int i = 1; i <= n*n; i++) {
                if(!volt[i]) buvos = false;
            }
            //osszegvizsgalat
            int ossz=0;
            for (int i = 0; i < n; i++) {
                ossz += m[0][i];
            }
            //sorok
            for (int i = 0; i < n; i++) {
            int tmpossz = 0;
                for (int j = 0; j < n; j++) {
                   tmpossz += m[i][j];
                }
                if(tmpossz!=ossz) buvos = false;
            }
            //oszlopok
            for (int i = 0; i < n; i++) {
            int tmpossz = 0;
                for (int j = 0; j < n; j++) {
                   tmpossz += m[j][i];
                }
                if(tmpossz!=ossz) buvos = false;
            }
            //foatlo
            int tmpossz = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if(i==j)tmpossz += m[i][j];
                }
            }
            if(tmpossz!=ossz) buvos = false;
           //mellekatlo
           tmpossz = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if(j==n-1-i)tmpossz += m[i][j];
                }
            }
            if(tmpossz!=ossz) buvos = false;

            System.out.println(buvos ? "YES" : "NO");
        }

    }

}