// 願ったんなら叶えてしまえやって
// Think twice, code once.
#include <bitset>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n;
unsigned ans;
bitset<1005> g[1005];

unsigned calc1() { //
	unsigned res = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++) res += g[i][j];
	return res;
}
unsigned calc2() { //
	unsigned res = 0;
	for (int i = 1; i <= n; i++) {
		int num = g[i].count();
		res += num * (num - 1) / 2;
	}
	return res;
}
unsigned calc3() {
	unsigned res = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			if (g[i][j]) {
				int A = g[i].count() - 1, B = g[j].count() - 1, C = (g[i] & g[j]).count();
				A -= C, B -= C;
				// eprintf("%d %d %d %d %d\n", i, j, A, B, C);
				if (A >= 0 && B >= 0)
					res += A * B + A * C + B * C;
				if (C >= 0) res += C * (C - 1);
			}
	return res;
}
unsigned calc4() {
	long long res = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			if (g[i][j]) res += (g[i] & g[j]).count();
	return res / 3;
}
unsigned calc5() { //
	unsigned res = 0;
	for (int i = 1; i <= n; i++) {
		int num = g[i].count();
		if (num >= 3) res += (long long)num * (num - 1) * (num - 2) / 6;
	}
	return res;
}
unsigned calc6() {
	unsigned res = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			if (g[i][j]) {
				int num = (g[i] & g[j]).count();
				res += num * (num - 1) / 2;
			}
	return res;
}
unsigned calc7() {
	long long res = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++) {
			int num = (g[i] & g[j]).count();
			res += num * (num - 1) / 2;
		}
	return res / 2;
}
unsigned calc8() {
	unsigned res = 0;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (i != j) {
				int A = (g[i] & g[j]).count(), B = g[i].count() - 2 - g[i][j];
				if (B > 0) res += (long long)A * (A - 1) / 2 * B;
			}
	return res;
}
unsigned calc9() {
	unsigned res = 0;
	for (int i = 1; i <= n; i++) {
		unsigned num = 0;
		for (int j = 1; j <= n; j++)
			if (g[i][j]) num += (g[i] & g[j]).count();
		num /= 2;
		if (num > 1) res += num * (num - 1) / 2;
	}
	return res - calc6() * 2;
}

int main() {
	while (scanf("%d", &n) != EOF) {
		for (int i = 1; i <= n; i++) {
			g[i].reset();
			for (int j = 1; j <= n; j++) {
				int x;
				scanf("%1d", &x);
				g[i][j] = x;
			}
		}
		ans = 0;
		ans += calc1() * 2, ans += calc2() * 12, ans += calc3() * 6;
		ans += calc4() * 24, ans += calc5() * 12, ans += calc6() * 36;
		ans += calc7() * 48, ans += calc8() * 12, ans += calc9() * 24;
		// eprintf("%d\n", calc8());
		printf("%u\n", ans);
	}
	return 0;
}
/*
6
011111
101111
110111
111011
111101
111110
*/