Description：

Solution：

Code：

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<cstring>

using namespace std;

int n;

#define MAXN 17

int p[MAXN];

long long ans = 0;

void dfs(int pos,int l,int r,int u)

{

	if(pos == n + 1)

	{

		++ans;

		return;

	}

	int k = l | r | u | p[pos];

	for(int i = 0;i < n;++i)

	{

		if((k & (1 << i)) == 0)

		{

			dfs(pos + 1,(l | (1 << i)) << 1,(r | (1 << i)) >> 1,u | (1 << i));

		}

	}

	return;

}

int main()

{

	scanf("%d",&n);

	int k;

	for(int i = 1;i <= n;++i)

	{

		for(int j = 1;j <= n;++j)

		{

			scanf("%d",&k);

			p[i] |= (k << (j - 1));

		}

	}

	dfs(1,0,0,0);

	cout << ans << endl;

	return 0;

}