Ruudukko

import random

# n = 50
# rows = []
# for i2 in range(n):
#     rows.append(random.sample(range(1, n*n+1), n*n))

# n = 3
# rows = [
#     [2,1,3], 
#     [1,1,1], 
#     [9,2,7]
# ]

n = int(input())
rows = []
for i in range(n):
    rows.append([int(x) for x in input().split(" ")])

# import time
# starttt = time.perf_counter()

unique_numbers = []
for i2 in range(n):
    for j1 in range(n):
        if(rows[i2][j1] not in unique_numbers):
            unique_numbers.append(rows[i2][j1])
            
unique_numbers = sorted(unique_numbers)

def get_coordinates_of(lambda_function):
    coords = []
    for i in range(n):
        for j in range(n):
            if lambda_function(rows[i][j]):
                coords.append((i, j))
    return coords

cache = {}

for num in unique_numbers:

    coords = get_coordinates_of(lambda x: x == num)
    for c in coords:
        lines = []
        for j1 in range(n):
            if rows[c[0]][j1] < num:
                lines.append((c[0], j1))
            if rows[j1][c[1]] < num:
                lines.append((j1, c[1]))

        cache[c] = sum([cache[x] for x in lines]) + 1

print(sum(cache.values()) % (10**9 + 7))

# print(1000 * (time.perf_counter() - starttt))