import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf = 1L << 50;
enum mod = 10L^^9 + 7;

void main() {
    int n;
    scan(n);
    auto a = iota(n).map!(i => readln.split.to!(int[])).array;
    auto dp = new long[](1<<n);
    dp[0] = 1;

    foreach (s ; 1 .. 1<<n) {
        auto i = popcnt(s) - 1;
        foreach (j ; 0 .. n) {
            if (s & (1<<j) && a[i][j]) {
                dp[s] += dp[s ^ (1<<j)];
                dp[s] %= mod;
            }
        }
    }

    long ans = dp[(1<<n) - 1];
    writeln(ans);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}