#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));

long long color[2000000];
//連結グラフなら1回でok
//cは0以外ならなんでも
bool bipartite_check(const vector<vector<long long>> &G, long long v, long long c)
{
    color[v] = c;
    for (long long nv : G[v])
    {
        if (color[nv] == c)
            return false;
        if (color[nv] == 0)
        {
            if (!bipartite_check(G, nv, -c))
                return false;
        }
    }
    return true;
}
/*
全頂点対最短距離を求める
※必ずwarshall_floyd_init(V, dist);を記述した後入力を受け取らないとバグります...
dist[i][i]<0なら負閉路あり
dist[i][j]==1e18ならi->jの経路を持たない
計算量O(V^3)
*/
void warshall_floyd_init(long long V, vector<vector<long long>> &dist)
{
    //初期化
    for (long long i = 0; i < V; i++)
    {
        for (long long j = 0; j < V; j++)
        {
            if (i == j)
                dist[i].push_back(0);
            else
                dist[i].push_back(1e18);
        }
    }
}
void warshall_floyd(long long V, vector<vector<long long>> &dist)
{
    for (long long k = 0; k < V; k++)
    {
        for (long long i = 0; i < V; i++)
        {
            for (long long j = 0; j < V; j++)
            {
                if (dist[i][k] != 1e18 && dist[k][j] != 1e18)
                    dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
}

int main()
{
    cout << fixed << setprecision(30);
    ll N;
    cin >> N;
    vector<vector<ll>> g(N); //二部グラフ判定用
    vector<string> field(N);
    loop(i, N) cin >> field[i];
    vector<vector<long long>> dist(N);
    //以下必須!
    warshall_floyd_init(N, dist);
    //入力受け取り
    loop(i, N)
    {
        loop(j, N)
        {
            if (j > i)
                continue;
            if (field[i][j] == '1')
            {
                dist[i][j] = 1;
                dist[j][i] = 1;
                g[i].push_back(j);
                g[j].push_back(i);
            }
        }
    }
    warshall_floyd(N, dist);
    if (!bipartite_check(g, 0, 1))
    {
        putout(-1);
        return 0;
    }
    ll ans = 0;
    loop(i, N)
    {
        loop(j, N)
        {
            if (dist[i][j] != 1e18)
                ans = max(ans, dist[i][j]);
        }
    }
    putout(ans + 1);
    return 0;
}


Measured memory_bytes: 4348