/*input
1
0
*/
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author masterbios
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CLinovaAndKingdom solver = new CLinovaAndKingdom();
        solver.solve(1, in, out);
        out.close();
    }

    static class CLinovaAndKingdom {

        final int MAXN = (int) (1 << 21) + 10;
        final long mod = (long) (1e9) + 7;
        long dp[] = new long[MAXN];
        int a[][] = new int[21][21];
        int n;
        int allmask;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
        	n = in.nextInt();
        	for (int i = 0; i < n; i++) {
        		for (int j = 0; j < n; j++) a[i][j] = in.nextInt();
        	}
        	allmask = (1 << n) - 1;
        	for (int i = 0; i <= allmask; i++) dp[i] = -1;
        	out.println(solve(0, 0));
        }

        public long solve(int mask, int i) {
        	if (mask == allmask) return 1;
        	if (i >= n) return 0;
        	if (dp[mask] != -1) return dp[mask];
            long ans = 0;
        	for (int j = 0; j < n; j++) {
        		if ((mask & (1 << j)) != 0) continue;
        		if (a[i][j] == 1) {
        			ans += solve((mask | (1 << j)), i + 1);
        			if (ans >= mod) ans -= mod;
        		}
        	}
        	return dp[mask] = ans;
        } 



        public int max(int ...a) {
            int max = Integer.MIN_VALUE;
            for (int i : a) max = Math.max(max, i);
            return max;
        }

        public int min(int ...a) {
            int min = Integer.MAX_VALUE;
            for (int i : a) min = Math.min(min, i);
            return min;
        }

        public long max(long ...a) {
            long max = Long.MIN_VALUE;
            for (long i : a) max = Math.max(max, i);
            return max;
        }

        public long min(long ...a) {
            long min = Long.MAX_VALUE;
            for (long i : a) min = Math.min(min, i);
            return min;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreElements()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

    }
}




Measured memory_bytes: 41556