#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

bool check_bipartite(int n, vvi & g, vi & color) {
  rep (u, n) {
    for (int v: g[u]) {
      if (min(color[u], color[v]) != 0 ||max(color[u], color[v]) != 1) {
        return false;
      }
    }
  }
  return true;
}

bool is_bipartite(int n, vvi & g) {
  vi color(n, -1);
  color[0] = 0;
  deque<int> que = {0};
  while (!que.empty()) {
    int u = que.front();
    que.pop_front();
    for (int v: g[u]) {
      if (color[v] == color[u]) {
        return false;
      } else if (color[v] == -1) {
        color[v] = 1 - color[u];
        que.push_back(v);
      }
    }
  }
  assert (check_bipartite(n, g, color));
  return true;
}

vi calculate_distance(int n, vvi & g, int s) {
  vi dist(n, -1);
  dist[s] = 0;
  deque<int> que = {s};
  while (!que.empty()) {
    int u = que.front();
    que.pop_front();
    for (int v: g[u]) {
      if (dist[v] == -1) {
        dist[v] = dist[u] + 1;
        que.push_back(v);
      }
    }
  }
  return dist;
}

int diameter(int n, vvi & g) {
  vi dist0 = calculate_distance(n, g, 0);
  int max_i = 0;
  rep (i, n) {
    if (dist0[max_i] < dist0[i]) {
      max_i = i;
    }
  }
  vi dist = calculate_distance(n, g, max_i);
  int ans = 0;
  rep (i, n) {
    if (ans < dist[i]) {
      ans = dist[i];
    }
  }
  return ans;
}

int main() {
  int n;
  scan(n);
  vvec<char> s(n, vector<char>(n));
  scan(s);

  vvi g(n);
  rep (i, n) {
    rep (j, n) {
      if (s[i][j] == '1') {
        g[i].push_back(j);
      }
    }
  }

  if (not is_bipartite(n, g)) {
    print(-1);
    return 0;
  }

  int ans = 0;
  rep (i, n) {
    auto dist = calculate_distance(n, g, i);
    rep (j, n) {
      ans = max(ans, dist[j] + 1);
    }
  }
  print(ans);

  return 0;
}


Measured memory_bytes: 888