import sys

def main():
    n = int(sys.stdin.readline())
    if n == 0:
        print("No")
        return

    op_table = []
    for _ in range(n):
        row = list(map(int, sys.stdin.readline().split()))
        op_table.append(row)

    # Check associativity
    for a in range(n):
        for b in range(n):
            for c in range(n):
                ab = op_table[a][b]
                bc = op_table[b][c]
                left = op_table[ab][c]
                right = op_table[a][bc]
                if left != right:
                    print("No")
                    return

    # Find identity element
    unit_e = None
    for e in range(n):
        valid = True
        for x in range(n):
            if op_table[e][x] != x or op_table[x][e] != x:
                valid = False
                break
        if valid:
            if unit_e is not None:  # more than one identity candidate
                print("No")
                return
            unit_e = e

    if unit_e is None:
        print("No")
        return

    # Check inverses
    for x in range(n):
        found = False
        for i in range(n):
            if op_table[x][i] == unit_e and op_table[i][x] == unit_e:
                found = True
                break
        if not found:
            print("No")
            return

    print("Yes")

if __name__ == "__main__":
    main()