#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
using namespace std;
typedef long long ll;
const int maxn = 21;
const int MOD = 1e9 + 7;
int n;
int mat[maxn][maxn];
int dp[maxn][1 << maxn];

int rec(int at, int women_taken) {
    if(__builtin_popcount(women_taken) == n) {
        return 1;
    }
    if(at >= n) {
        return 0;
    }
    if(dp[at][women_taken] != -1) {
        return dp[at][women_taken];
    }

    int res = 0;

    for(int i = 0; i < n; i++) {
        if(mat[at][i] == 1) {
            if((women_taken & (1 << i)) == 0) {
                int new_taken = (women_taken | (1 << i));
                res += rec(at + 1, new_taken);
                res %= MOD;
            }
        }
    }
    dp[at][women_taken] = res;
    return res;
}
int main()
{
    ios_base::sync_with_stdio(false);
    memset(dp, -1, sizeof dp);
    cin >> n;

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            cin >> mat[i][j];
        }
    }

    cout << rec(0, 0) << endl;
    return 0;
}