#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#define N 205*2
#define M 25
#define inf 0x3f3f3f3f
#define LL long long
using namespace std;

int nn,map[N];
LL sum=0;

struct DLX{
	int U[N],D[N],L[N],R[N],row[N],col[N];
	int n,m;
	LL sum;
	int size;
	void init(int C){
		sum=0;
		n=C;
		m=2*C;
		size=m;
		for(int i=0;i<=m;i++){
			U[i]=i;
			D[i]=i;
			L[i]=i-1;
			R[i]=i+1;
			col[i]=i;
			row[i]=0;
		}
		L[0]=m;
		R[m]=0;
		D[0]=U[0]=inf;
	}
	void push(int r,int c1,int c2){
		int z1=++size;
		int z2=++size;
		U[z1]=U[c1];
		U[z2]=U[c2];
		D[z1]=c1;
		D[z2]=c2;
		U[c1]=z1;
		U[c2]=z2;
		D[U[z1]]=z1;
		D[U[z2]]=z2;
		
		R[z1]=z2;
		R[z2]=z1;
		L[z1]=z2;
		L[z2]=z1;
		
		row[z1]=r;
		col[z1]=c1;
		row[z2]=r;
		col[z2]=c2;
	}
	
	void del(int c){
		R[L[c]]=R[c];
		L[R[c]]=L[c];
		for(int i=D[c];i!=c;i=D[i]){
			for(int j=R[i];j!=i;j=R[j]){
				
				D[U[j]]=D[j];
				U[D[j]]=U[j];
			}
		}
		return ;
	}
	void reback(int c){
		for(int i=U[c];i!=c;i=U[i]){
			for(int j=L[i];j!=i;j=L[j]){
				D[U[j]]=j;
				U[D[j]]=j;
			}
		}
		R[L[c]]=c;
		L[R[c]]=c;
		return ;
	}
	void dancing(int u,int dep){	
		if(dep==n||R[0]==0){
			sum++;
			return ;
		}
		int ii=R[0];
		del(ii);
		for(int i=D[ii];i!=ii;i=D[i]){
			for(int j=R[i];j!=i;j=R[j]){
				del(col[j]);
			}
			dancing(R[ii],dep+1);
			for(int j=L[i];j!=i;j=L[j]){
				reback(col[j]);
			}
		}
		reback(ii);
		
		return ;
	}
	
}dlx;


int main(){
	freopen("chess_2016.in","r",stdin);
	freopen("chess_2016.out","w",stdout);
	cin>>nn;
	dlx.init(nn);	
	int l=1;	
	for(int i=1;i<=nn;i++){
		for(int j=1;j<=nn;j++){
			int c;
			cin>>c;
			if(c!=1)
				dlx.push(l,j,i+nn);
		}
	}
	dlx.dancing(0,0);
	cout<<dlx.sum;
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}