#include <bits/stdc++.h>
using namespace std;

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;

template <class F>
struct ycr {
	F f;
	
	template <class T>
	explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args>
	decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F>
decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);

	int N; cin >> N;

	const int L = 2048;
	using bs = bitset<L>;
	vector<bs> adj(N);
	for (int i = 0; i < N; i++) {
		string s; cin >> s;
		for (int j = 0; j < N; j++) {
			if (s[j] == '1') adj[i].set(j);
		}
	}

	ll ans = 0;
	vector<int> bfs; bfs.reserve(N);
	vector<int> dist(N, N);
	for (int st = 0; st < N; st++) {
		bfs.clear();
		bfs.push_back(st);

		fill(dist.begin(), dist.end(), N);
		dist[st] = 0;

		bs todo;
		todo.set();
		todo.reset(st);

		for (int z = 0; z < int(bfs.size()); z++) {
			const int cur = bfs[z];
			const bs reachable = todo & adj[cur];
			int nxt = int(reachable._Find_first());
			while (nxt < N) {
				assert(dist[nxt] == N);
				dist[nxt] = dist[cur]+1;
				todo.reset(nxt);
				bfs.push_back(nxt);
				nxt = int(reachable._Find_next(nxt));
			}
		}
		for (const int& d : dist) {
			ans += d*d;
		}
	}
	cout << ans << '\n';
}