Nice Array

You are given an $N \times N$ array $A$ and a permutation $P$ of the integers from $0$ to $N-1$.

$\mathrm{Sum}(A, P) = A[0][P[0]] + A[1][P[1]] + \cdots + A[N-1][P[N-1]]$

An array is nice if $\mathrm{Sum}(A, P)$ is the same no matter which permutation $P$ you pick.

Some cells of $A$ have been erased. Write a program that counts the ways to fill in every erased cell so that the array is nice. Two ways are different if the finished arrays differ in at least one cell.

The first line has the size $N$ ($1 \le N \le 50$) of the array $A$.

Each of the next $N$ lines has one row of $A$ as $N$ characters with no spaces. An erased cell is -, and every other cell is an integer between $0$ and $9$.

Print the number of ways to make the array nice, modulo 1,000,000,007, on the first line.

A number you fill in is an integer that is at least $0$, and it may be larger than $9$. No input has an infinite number of ways.