#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

#define NMAX 16

char R[NMAX][NMAX];
int S[NMAX], V[NMAX], n, i, j, sol;
vector <int> grup[NMAX];

void check(int ng) {
	int i, j, k;
	
	if (ng < 2)
		return;
	
	for (i = 1; i <= ng; i++) {
		memset(V, 0, sizeof(V));
		for (j = 0; j < grup[i].size(); j++)
			for (k = 1; k <= n; k++)
				if (R[grup[i][j]][k] == '1')
					V[S[k]] = 1;
		
		for (j = 1; j <= ng; j++)
			if (i != j && !V[j])
				return;
	}
	
	sol++;
}

void back(int k, int ng) {
	int i;
	
	if (k == n+1) {
		check(ng);
		return;
	}
	
	for (i = 1; i <= ng; i++) {
		grup[i].push_back(k);
		S[k] = i;
		back(k+1, ng);
		grup[i].pop_back();
	}
	
	grup[++ng].push_back(k);
	S[k] = ng;
	back(k+1, ng);
	grup[ng--].pop_back();
}

int main() {
	
	FILE *f = fopen("copii.in", "r");
	FILE *g = fopen("copii.out", "w");
	
	fscanf(f, "%d", &n);
	for (i = 1; i <= n; i++) {
		fscanf(f, "\n");
		for (j = 1; j <= n; j++)
			fscanf(f, "%c", &R[i][j]);
	}
	
	back(1, 0);
	
	fprintf(g, "%d", sol);
	
	fclose(f); fclose(g);
	
	return 0;
}