#include <bits/stdc++.h>
using namespace std;
ifstream in("copii.in");
ofstream out("copii.out");
int n, msk[1500], fr[1500], nr, st[15];
char c;
bool viz[1500];
int check(int n) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j)
if ((msk[st[i]] & st[j]) == 0)
return 0;
return 1;
}
void back(int lvl, int mask) {
st[lvl] = mask;
if (lvl > 1 && check(lvl))
nr++;
if (__builtin_popcount(mask) < 2)
return;
for (int submask = mask; submask > 0; submask = (submask - 1) & mask) {
int dad = (mask ^ submask);
if (__builtin_popcount(submask) <= __builtin_popcount(dad)) {
if (__builtin_popcount(submask) == __builtin_popcount(dad) && submask > dad)
continue;
st[lvl] = dad;
back(lvl + 1, submask);
}
}
}
int main() {
in >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
in >> c;
if (c == '1')
fr[i] |= (1 << j);
}
for (int mask = 1; mask < (1 << n); mask++)
for (int bit = 0; bit < n; bit++)
if (mask & (1 << bit))
msk[mask] |= fr[bit];
back(1, (1 << n) - 1);
out << nr;
return 0;
}