#define INPUT "./io/test.in"
#define OUTPUT "./io/test.out"
#ifdef NARUT_LOCAL
	#include "local.hpp"
	#include "reopen.hpp"
	#else
	#pragma GCC optimize("-O2", "-ftree-vectorize")
	#include <algorithm>
	#include <array>
	#include <bitset>
	#include <cassert>
	#include <cctype>
	#include <cmath>
	#include <complex>
	#include <cstdint>
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <deque>
	#include <exception>
	#include <functional>
	#include <initializer_list>
	#include <iomanip>
	#include <iostream>
	#include <iterator>
	#include <limits>
	#include <list>
	#include <locale>
	#include <map>
	#include <memory>
	#include <numeric>
	#include <queue>
	#include <random>
	#include <set>
	#include <sstream>
	#include <stack>
	#include <stdexcept>
	#include <tuple>
	#include <type_traits>
	#include <utility>
	#include <vector>
	using namespace std;
	#define DBG(...)
	#define DBG2(...)
	#define Debug(...)
	#define TM_(...) template <class __VA_ARGS__>
	#define ENABLE(...) TM_(T) static enable_if_t<__VA_ARGS__>
	#define SFINAE(name, ...)                                                                \
		TM_(, class = void) struct name##_s : false_type {};                                 \
		TM_(T) struct name##_s<T, decltype(void(__VA_ARGS__))> : true_type {};               \
		TM_(T) constexpr auto name = name##_s<T>::value;
	namespace narut {
	TM_(T) using TupSz = tuple_size<decay_t<T>>;
	SFINAE(Iterable, begin(declval<T &>()))
	SFINAE(IsTuple, TupSz<T>{})
	SFINAE(Coutable, cout << declval<T &>())
	SFINAE(Cinable, cin >> declval<T &>())
	TM_(, class = void) struct Spc { static const char val = '\n'; };
	TM_(T) struct Spc<T, enable_if_t<Coutable<T>>> { static const char val = ' '; };
	struct Ctx {
		ENABLE(Coutable<T>) Write(T const &t) { cout << t; }
		ENABLE(!Coutable<T> and Iterable<T>) Write(T const &t) {
			auto it = begin(t), e = end(t);
			if (it != e) Write(*it++);
			for (; it != e; Write(*it++)) cout << Spc<decltype(*it)>::val;
		}
		TM_(T, size_t... Is)
		static void WriteTup(T const &t, index_sequence<Is...>) {
			(void)(int[]){0, ((Is == 0) ? 0 : ((cout << ' '), 0), Write(get<Is>(t)), 0)...};
		}
		ENABLE(!Coutable<T> and !Iterable<T> and IsTuple<T>) Write(T const &t) {
			WriteTup(t, make_index_sequence<TupSz<T>::value>{});
		}
		ENABLE(Cinable<T>) Read(T &t) { cin >> t; }
		ENABLE(!Cinable<T> and Iterable<T>) Read(T &t) {
			for (auto &&x : t) Read(x);
		}
		TM_(T, size_t... Is) static void ReadTup(T &t, index_sequence<Is...>) {
			(void)(int[]){0, (Read(get<Is>(t)), 0)...};
		}
		ENABLE(!Cinable<T> and !Iterable<T> and IsTuple<T>) Read(T &t) {
			ReadTup(t, make_index_sequence<TupSz<T>::value>{});
		}
	};
	void Cout() { cout << '\n'; }
	TM_(F, class... Ts) void Cout(F const &f, Ts const &... ts) {
		Ctx::Write(f);
		(void)(int[]){0, (cout << ' ', Ctx::Write(ts), 0)...};
		cout << '\n';
	}
	TM_(T) T Cin() {
		T t;
		Ctx::Read(t);
		return t;
	}
	TM_(T) void Cin(T &t) { Ctx::Read(t); }
	TM_(T) void Cin(T &t, int n) {
		t.resize(n);
		Ctx::Read(t);
	}
	TM_(T) struct Big {
		constexpr operator T() const {
			T x = 0, mask = 0x3f;
			for (int i = 0; i < sizeof(T); i++) x |= mask << 8 * i;
			return x;
		}
	};
	} // namespace narut
	using narut::Big;
	using narut::Cin;
	using narut::Cout;
	using ll = long long;

	using uint = unsigned int;
#endif

template <class T, class AddT, class MultT, T P>
struct ModNum {
    T val = 0;
    constexpr ModNum() = default;
    constexpr ModNum(T x) : val(x) {}
    template <class S>
    static constexpr ModNum Safe(S x) {
        return static_cast<T>(((x % P) + P) % P);
    }
    explicit constexpr operator T() const { return val; }

    constexpr bool operator==(ModNum rhs) const { return val == rhs.val; }
    constexpr bool operator!=(ModNum rhs) const { return val != rhs.val; }
    constexpr ModNum operator-() const { return (val == 0) ? (*this) : (P - val); }

    constexpr ModNum& operator+=(ModNum rhs) { return *this = Add(val, rhs.val); }
    constexpr ModNum& operator-=(ModNum rhs) { return *this = Sub(val, rhs.val); }
    constexpr ModNum& operator*=(ModNum rhs) { return *this = Mult(val, rhs.val); }
    constexpr ModNum& operator/=(ModNum rhs) { return *this *= rhs.Inverse(); }

    template <class S>
    constexpr ModNum Pow(S ex) const {
        if (P == 1) return 0;
        if (ex < 0) return Pow(-ex).Inverse();
        ModNum result = 1;
        ModNum base(*this);
        while (ex > 0) {
            if (ex & 1) result *= base;
            ex >>= 1;
            base *= base;
        }
        return result;
    }
    constexpr ModNum Inverse() const { return Pow(P - 2); }
    friend constexpr ModNum operator+(ModNum lhs, ModNum rhs) { return Add(lhs.val, rhs.val); }
    friend constexpr ModNum operator-(ModNum lhs, ModNum rhs) { return Sub(lhs.val, rhs.val); }
    friend constexpr ModNum operator*(ModNum lhs, ModNum rhs) { return Mult(lhs.val, rhs.val); }
    friend constexpr ModNum operator/(ModNum lhs, ModNum rhs) { return lhs * rhs.Inverse(); }

   private:
    static constexpr T Add(AddT lhs, AddT rhs) {
        auto sum = lhs + rhs;
        return (sum < P) ? sum : (sum - P);
    }
    static constexpr T Sub(AddT lhs, AddT rhs) {
        auto dif = lhs - rhs;
        return (dif >= 0) ? dif : (dif + P);
    }
    static constexpr T Mult(MultT lhs, MultT rhs) { return static_cast<T>((lhs * rhs) % P); }
    friend std::ostream& operator<<(std::ostream& os, ModNum m) { return os << m.val; }
    friend std::istream& operator>>(std::istream& is, ModNum& m) {
        is >> m.val;
        return is;
    }
};
using Num = ModNum<int, int, long long, 1000000007>;



auto Run() {
	int n; cin>>n;

	vector<vector<int> > A(n, vector<int> (n));
	Cin(A);

	Debug(A);

	const int mx = 1<<n;
	vector<Num> dp(mx);

	using bs = bitset<21>;

	dp[0]=1;
	for (int b = 0; b < mx; b++) {
		bs B = b;
		int i = B.count();
		for (int j = 0; j < n; j++) {
			if (B[j]) continue;
			if (A[i][j] == 0) continue;
			bs t = b;
			t[j] = 1;
			dp[t.to_ullong()] += dp[b];			
		}
	}
	// for (int b = 1; b < mx; b++) {
	// 	bs B = b;
	// 	int i = B.count() - 1;
	// 	for (int j = 0; j < n; j++) {
	// 		if (!B[j] or !A[i][j]) continue;
	// 		bs t = b;
	// 		t[j] = 0;
	// 		dp[b] += dp[t.to_ullong()];
	// 	}
	// }

	Debug(dp[0b0010]);
	cout << dp.back();
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(10);

	Run();
}



Measured memory_bytes: 8448