Given a graph , a clique is a sub-graph , so that for all vertex pairs , in , there exists an edge (, ) in . Maximum clique is the clique that has maximum number of vertex.
Consists of multiple tests. The first line of each test case contains the number of vertices . The following lines has numbers or each, indicating whether an edge exists between (line number) and (column number). The last line contains = and must not be processed.
For each test case print on a separate line the number of vertices in maximum clique.