// 2024 IUSB Programming Competition
// Round 1 Problem 6
// Latin Square
// Solution by Liguo Yu

import java.util.Scanner;
import java.util.*;

public class round1_p6
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        int size = input.nextInt();
        
        int[][] data = new int[size][size];
        
        for(int i=0; i<size; i++)
        {
            for(int j=0; j<size; j++)
            {
                data[i][j] = input.nextInt();
            }
        }
        
        HashSet<Integer>[] rows = new HashSet[size];
        HashSet<Integer>[] cols = new HashSet[size];
     
        for(int i = 0; i < size; i++)
        {
            rows[i] = new HashSet<>();
            cols[i] = new HashSet<>();
        }
     
        boolean valid = true;
     
        for(int i = 0; i < size; i++)
        {
            for(int j = 0; j < size; j++)
            {
                rows[i].add(data[i][j]);
                cols[j].add(data[i][j]);
            }
        }
        
        if(rows[0].size() != size) valid = false;
        else
        {
            for(int i=0; i<size; i++)
            {
                if(rows[i].equals(rows[0]) == false) valid = false;
            }
            
            for(int i=0; i<size; i++)
            {
                if(cols[i].equals(rows[0]) == false) valid = false;
            }
        }
        
        if(valid == true) System.out.println("yes");
        else System.out.println("no");
    }
}