#include <bits/stdc++.h>
#define test(x) cout<<#x<<" = "<<x<<endl
#define endl '\n'
#define int long long
using namespace std;
const int MAXN = 1e6 + 100, N = 1e9;
int n, m;
string s;

int a[3] = {4, 9, 25}, res[3];
int isp[MAXN];
vector<int> pm;
void pre() {
	int NN = sqrt(1e9) + 10;
	for (int i = 2; i <= NN; ++i) {
		if (isp[i] == 0)
			pm.push_back(i);
		for (auto p : pm) {
			if (i * p > NN)
				break;
			isp[i * p] = 1;
			if (i % p == 0)
				break;
		}
	}
}

void solve() {
	n = 200, m = 44100;
	{
		string s0;
		for (int i = 1; i <= 10; ++i) {
			cin >> s0;
			s += s0;
		}
	}
	auto chk2 = [&](int k) -> bool {
		vector<int> vis(210, 1);
		for (auto p : pm) {
			int pp = p * p, t = k % pp;
			t = (pp - t) % pp;
			while (t < 200) {
				vis[t] = 0;
				t += pp;
			}
		}
		for (int i = 0; i < 200; ++i)
			if (vis[i] != s[i] - '0')
				return 0;
		return 1;
	};
	int vis[50] = {0};
	for (int i = 0; i < 3; ++i)
		for (int st = 0; st < a[i]; ++st) {
			int ok = 1;
			for (int j = st; j < n; j += a[i])
				if (s[j] == '1') {
					ok = 0;
					break;
				}
			if (ok) {
				if (res[i] > 0) {
					cout << "-1";
					return;
				}
				res[i] = st;
			}
		}
	for (int st = 0; st < 49; ++st) {
		int ok = 1;
		for (int j = st; j < n; j += 49)
			if (s[j] == '1') {
				ok = 0;
				break;
			}
		if (ok) {
			vis[(49 - st) % 49] = 1;
		}
	}
	vector<int> ast, ans;
	for (int st = 1; st <= m; ++st) {
		int ok = 1;
		for (int i = 0; i < 3; ++i)
			if ((st + res[i]) % a[i] != 0)
				ok = 0;
		if (vis[st % 49] == 0)
			ok = 0;
		if (ok)
			ast.push_back(st);
	}
	for (int st : ast)
		for (int i = st; i <= 1e9; i += m) {
			if (chk2(i)) {
				ans.push_back(i);
				break;
			}
		}
	if (ans.size() == 0)
		cout << "-1";
	else {
		sort(ans.begin(), ans.end());
		cout << ans[0];
	}
}

signed main() {
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	pre();
	int tt = 1;
//	cin >> tt;
	while (tt--)
		solve();
}

/*

11101110011011101010
11100100111011101110
11100110001010101110
11001110111011001110
01101110101011101000
11101110111011100110
01100010111011001110
11101100101001101110
10101110010011001110
11101110011011101010

01010101010101010101
10101010101010101010
01010101010101010101
10101010101010101010
01010101010101010101
10101010101010101010
01010101010101010101
10101010101010101010
01010101010101010101
10101010101010101010

*/