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

template <typename T>
class Graph
{
public:
    struct Edge
    {
        long long to;
        T distance;
        Edge(const long long t, const T d)
        {
            this->to = t;
            this->distance = d;
        }
        bool operator<(const Edge &e) const
        {
            return this->distance < e.distance;
        }
        bool operator<=(const Edge &e) const
        {
            return this->distance <= e.distance;
        }
        bool operator>(const Edge &e) const
        {
            return this->distance > e.distance;
        }
        bool operator>=(const Edge &e) const
        {
            return this->distance >= e.distance;
        }
        bool operator==(const Edge &e) const
        {
            return this->distance == e.distance;
        }
    };
    vector<vector<T>> adjacency_matrix;
    long long node;
    T initial_value;
    vector<vector<Edge>> edge;

    Graph(const long long N)
    {
        setNode(N);
        initializeEdgeVector();
    }

    Graph(const long long N, const T init)
    {
        setNode(N);
        initializeEdgeVector();
        setInitialValue(init);
    }

    void setNode(const long long N)
    {
        this->node = N + 1;
    }

    void setInitialValue(const long long init)
    {
        this->initial_value = init;
    }

    void initializeAdjacencyMatrix()
    {
        this->adjacency_matrix = vector<vector<T>>(
            this->node, vector<T>(this->node, this->initial_value));
    }

    void initializeAdjacencyMatrix(const T init)
    {
        setInitialValue(init);
        initializeAdjacencyMatrix();
    }

    void initializeEdgeVector()
    {
        this->edge = vector<vector<Edge>>(this->node);
    }

    void updateAdjacencyMatrix(const long long from, const long long to, const T distance = 1)
    {
        this->adjacency_matrix[from][to] = distance;
    }

    void addEdge(const long long from, const long long to, const T distance = 1)
    {
        this->edge[from].push_back({to, distance});
    }

    // O(V^3)
    // CAUTION: Use adjacency matrix
    vector<vector<T>> runFloydWarshall() const
    {
        vector<vector<T>> ret(this->adjacency_matrix);
        for (long long i = 0; i < this->node; i++)
        {
            for (long long j = 0; j < this->node; j++)
            {
                for (long long k = 0; k < this->node; k++)
                {
                    ret[j][k] = min(ret[j][k], ret[j][i] + ret[i][k]);
                }
            }
        }
        return ret;
    }

    // O(E)
    // CAUTION: Non-weighted only
    // CAUTION: Use edge vector
    T runBFS(const long long from, const long long to) const
    {
        vector<bool> visited(this->node, false);
        queue<long long> q;
        q.push(from);
        for (long long i = 1; i <= this->node && !q.empty(); i++)
        {
            queue<long long> tmp;
            while (!q.empty())
            {
                for (Edge e : this->edge[q.front()])
                {
                    if (e.to == to)
                    {
                        return i;
                    }
                    if (visited[e.to])
                    {
                        continue;
                    }
                    visited[e.to] = true;
                    tmp.push(e.to);
                }
                q.pop();
            }
            q = tmp;
        }
        return this->initial_value;
    }

    // O(VE)
    // CAUTION: Use edge vector
    vector<T> runBellmanFord(const long long from) const
    {
        vector<T> distance(this->node, this->initial_value);
        distance[from] = 0;

        for (long long i = 0; i < this->node - 1; i++)
        {
            for (long long j = 1; j < this->node; j++)
            {
                for (auto itr = this->edge[j].begin(); itr != this->edge[j].end(); itr++)
                {
                    if (distance[itr->to] > distance[j] + itr->distance)
                    {
                        distance[itr->to] = distance[j] + itr->distance;
                    }
                }
            }
        }

        for (long long i = 1; i < this->node; i++)
        {
            for (auto itr = this->edge[i].begin(); itr != this->edge[i].end(); itr++)
            {
                if (distance[itr->to] > distance[i] + itr->distance)
                {
                    distance[0]--;
                }
            }
        }
        return distance;
    }

    // O(E + VlogV)
    // CAUTION: Use edge vector
    vector<T> runDijkstra(const long long from) const
    {
        vector<T> distance(this->node, this->initial_value);
        priority_queue<Edge, vector<Edge>, greater<Edge>> queue;
        queue.push(Edge(from, 0));
        while (!queue.empty())
        {
            T d = queue.top().distance;
            long long to = queue.top().to;
            queue.pop();
            if (distance[to] == this->initial_value)
            {
                distance[to] = d;
                for (auto itr = this->edge[to].begin(); itr != this->edge[to].end(); itr++)
                {
                    if (distance[itr->to] == this->initial_value)
                    {
                        queue.push({itr->to, itr->distance + d});
                    }
                }
            }
        }
        return distance;
    }

    // O(ElogV)
    // CAUTION: Use edge vector
    T runPrim() const
    {
        vector<bool> is_visited(this->node, false);
        T cost = 0;
        priority_queue<Edge, vector<Edge>, greater<Edge>> queue;
        queue.push(Edge(1, 0));
        while (!queue.empty())
        {
            T distance = queue.top().distance;
            long long to = queue.top().to;
            queue.pop();
            if (!is_visited[to])
            {
                cost += distance;
                is_visited[to] = true;
                for (auto itr = this->edge[to].begin(); itr != this->edge[to].end(); itr++)
                {
                    queue.push({itr->to, itr->distance});
                }
            }
        }
        return cost;
    }

    T runKruskal()
    {
    }
};

int f(Graph<long long> g, int n, int start, int edge)
{
    vector<int> V(n, 0);
    V[start] = 1;
    vector<bool> visited(n, false);
    int current = 2;
    queue<int> q;
    q.push(start);
    while (!q.empty())
    {
        queue<int> tmp(q);
        queue<int>().swap(q);
        while (!tmp.empty())
        {
            int next = tmp.front();
            tmp.pop();
            visited[next] = true;
            V[next] = current;

            for (auto e : g.edge[next])
            {
                if (g.adjacency_matrix[next][e.to] == 0)
                {
                    continue;
                }

                if (V[e.to] > 0 && V[e.to] < current)
                {
                    return -1;
                }
                g.updateAdjacencyMatrix(next, e.to, 0);
                g.updateAdjacencyMatrix(e.to, next, 0);
                q.push(e.to);
                V[e.to] = current;
                visited[e.to] = true;
            }
        }
        current++;
    }

    return current - 2;
}

int main()
{
    int N;
    cin >> N;
    Graph<long long> g(N, 0);
    g.initializeAdjacencyMatrix();

    int edge = 0;
    string S;
    for (int i = 0; i < N; i++)
    {
        cin >> S;
        for (int j = 0; j < N; j++)
        {
            if (S[j] == '1')
            {
                g.updateAdjacencyMatrix(i, j, 1);
                g.addEdge(i, j);
                edge++;
            }
        }
    }
    edge /= 2;

    int ans = -1;
    for (int i = 0; i < N; i++)
    {
        ans = max(ans, f(g, N, i, edge));
    }
    cout << ans << endl;
}


Measured memory_bytes: 2384