The directed graph is given. Determine, does it contain a cycle.
First line contains number of vertices . Each of the next lines contains numbers, each of them is either or . -th number in the -th line equals to if and only if there exist an edge from -th vertex to -th. It is guaranteed that diagonal of the matrix contains zeros.
Print if there is no cycle in the graph and if cycle exists.